Submission #7586374

---

Source Code Expand

#include <iostream>
#include <vector>
#include <algorithm>
#include <string>
#include <stack>
#include <math.h>
#include <map>
#include<cmath>
#include<queue>

typedef long long ll;
using namespace std;
#define mod 10007
#define rep(i,n) for(ll i=0;i<n;i++)

int main(void){
  int n;cin >> n;
  int a;
  int cnt=0;
  for(int i=0;i<n;i++){
    cin >> a;
    while(a%2==0 || a%3==2){
      a--;
      cnt++;
    }
  }
  cout << cnt << endl;

  return 0;
}

Submission Info

Judge Result