#include<bits/stdc++.h>
using namespace std;
#define ff              first
#define ss              second
#define int             long long
#define pb              push_back
#define mp              make_pair
#define pii              pair<int,int>
#define vi              vector<int>
#define mii             map<int,int>
#define pqb             priority_queue<int>
#define pqs             priority_queue<int,vi,greater<int> >
#define setbits(x)      __builtin_popcountll(x)
#define zrobits(x)      __builtin_ctzll(x)
#define mod             1000000007
#define inf             1e18
#define ps(x,y)         fixed<<setprecision(y)<<x
#define mk(arr,n,type)  type *arr=new type[n];
#define w(x)            int x; cin>>x; while(x--)
#define pw(b,p)         pow(b,p) + 0.1
#define __              ios_base::sync_with_stdio(false);cin.tie(NULL);cout.tie(NULL);
#define rep(i,a,b) 		for(int i=a;i<b;i++)
#define repb(i,a,b) 	for(int i=a;i>=b;i--)
#define endl			"\n"
#define m(a)		    memset(a,0,sizeof(a))
#define all(x)                          begin(x), end(x)

void fastscan(int &x){
bool neg = false;register int c;
x = 0;c = getchar();
if(c=='-'){neg = true;c = getchar();}
for(; (c>47 && c<58); c=getchar()){x = x *10 + c - 48;}
if(neg){x *= -1;}}

void file(){
	#ifndef ONLINE_JUDGE
	freopen("in.txt" , "r" , stdin);
	freopen("out.txt" , "w" , stdout);
	#endif
}

int bs(int a[] , int s , int e, int x){
	if(s<=e){
		int m = (s+e)/2;
		if(a[m]==x)
			return m;
		else if(a[m] > x)
			return bs(a,s,m-1,x);
		else return bs(a,m+1,e,x);
	}
	return -1;
}

#define tr(x) cout<<x<<endl;
#define tr2(x,y) cout<<x<<" "<<y<<endl;
#define tr3(x,y,z) cout<<x<<" "<<y<<" "<<z<<endl;
#define tr4(w,x,y,z) cout<<w<<" "<<x<<" "<<y<<" "<<z<<endl;
#define tr5(v,w,x,y,z) cout<<v<<" "<<w<<" "<<x<<" "<<y<<" "<<z<<endl;
#define tr6(u,v,w,x,y,z) cout<<u<<" "<<v<<" "<<w<<" "<<x<<" "<<y<<" "<<z<<endl;

#define deb(x) cout<<#x<<"="<<x<<endl
#define deb2(x,y) cout<<#x<<"="<<x<<","<<#y<<"="<<y<<endl
#define deb3(x,y,z) cout<<#x<<"="<<x<<","<<#y<<"="<<y<<","<<#z<<"="<<z<<endl
#define deba(a) for(auto &x:a) cout<<x<<" ";

#define sd(x) cin >> x;
#define sd2(x,y) cin >> x >> y;
#define sd3(x,y,z) cin >> x >> y >> z;
#define sd4(w,x,y,z) cin >> w >> x >> y >> z;

bool is_pal(string s) {return equal(all(s), s.rbegin());}

int mypow(int a, int b){        //(logn) fast exponentiation
    int res = 1;            // call int x = mypow(2,5);
    while (b > 0) {
        if (b & 1)
            res = (res * a)%mod;
        a = (a * a)%mod;
        b >>= 1;
    }
    return (res%mod);
}

/*
	summation => O(NlogN) => O(logN) for factorisation, and O(N) for summation..
*/

const int N = 1e7+5;
int spf[N];
void sieveSPF(){
	for(int i=0 ; i<N+1 ; ++i) spf[i] = i;
	for(int i=4 ; i<N+1 ; i+=2) spf[i]=2;
	for(int i=3 ; i*i<N+1;i+=2){
		if(spf[i]==i){
			for(int j=i*i ; j<N+1 ; j+=i){
				spf[j] = i;
			}
		}
	}
}
int getFactors(int n){
	int cnt=1;
	map<int,int>m;
	while(n != 1){
		m[spf[n]]++;
		n/=spf[n];
	}
	for(auto itr : m){
		cnt*=(itr.ss+1);
	}
	return cnt;
}
void solve1(){
	//atcoder abc 172D
	sieveSPF();
	int n; cin >> n;
	int ans=0;
	// cout << getFactors(12) << endl;
	 for(int i=1; i<=n ; ++i){
	 	ans+=(i * getFactors(i));
	 }
	 cout << ans << endl;
}

void solve2(){
	//atcoder alsing A
	int l,r,d; cin >> l >> r >> d;
	int ans=0;
	for(int i=l ; i<r+ 1; ++i){
		if(i%d==0) ++ans;
	}
	cout << ans << endl;
}

void solve(){
	int n; cin >> n;
	int a[n]; for(int i=0 ; i<n ; ++i) cin >> a[i];
	int ans=0;
	for(int i=0 ; i<n ; ++i){
		if(((i+1)&1) and (a[i]&1)) ++ans;
	}
	cout << ans << endl;
}

int32_t main(){	
	__;
	file();
	solve();
	return 0;
}






Measured memory_bytes: 3608