PAT 天梯赛 L1-022. 奇偶分家 【水】

#include <iostream>
#include <cstdio>
#include <algorithm>
#include <cmath>
#include <deque>
#include <vector>
#include <queue>
#include <string>
#include <cstring>
#include <map>
#include <stack>
#include <set>
#include <cstdlib>
#include <ctype.h>
#include <numeric>
#include <sstream>
using namespace std;

typedef long long LL;
const double PI = 3.14159265358979323846264338327;
const double E = 2.718281828459;
const double eps = 1e-6;
const int MAXN = 0x3f3f3f3f;
const int MINN = 0xc0c0c0c0;
const int maxn = 1e5 + 5;
const int MOD = 1e9 + 7;

int main()
{
int n;
cin >> n;
int num;
int a[2] = {0};
for (int i = 0; i < n; i++)
{
scanf("%d", &num);
if (num & 1)
a[0]++;
else
a[1]++;
}
printf("%d %d\n", a[0], a[1]);
}