Submission #6899759

---

Source Code Expand

#include<iostream>
#include<string>
#include<vector>
#include<algorithm>
#include<map>
#include<set>
#include<cstdio>
#include<cmath>
#include<numeric>
#include<queue>
#include<stack>
#include<cstring>
#include<limits>
#define rep(i,a) for(int i=(int)0;i<(int)a;++i)
#define pb push_back
#define eb emplace_back
#define mp make_pair
#define fi first
#define se second
using ll=long long;
static const ll mod = 1e9 + 7;
static const ll INF = 1LL << 50;
using namespace std;


int main(){
    int n;
    cin>>n;
    int ans=0,a;
    rep(i,n){
      cin>>a;
      if(a==5)ans+=2;
      else if(a==6)ans+=3;
      else if(a%2==0)ans+=1;
    }
  cout<<ans<<endl;
    return 0;
}

Submission Info

Judge Result