n = int(input())
a = list(map(int, input().split()))
odds = 0
evens = 0
for i in range(n):
if a[i] % 2 == 0:
evens += 1
else:
odds += 1
print(min(odds, evens))#include <bits/stdc++.h>
using namespace std;
int main() {
ios::sync_with_stdio(false);
cin.tie(nullptr);
int n;
cin >> n;
int even = 0, odd = 0;
for (int i = 0; i < n; i++) {
int x;
cin >> x;
if (x % 2 == 0) {
even++;
} else {
odd++;
}
}
cout << min(even, odd) << endl;
return 0;
}387A - George and Sleep | 53A - Autocomplete |
1729G - Cut Substrings | 805B - 3-palindrome |
805C - Find Amir | 676C - Vasya and String |
1042B - Vitamins | 1729F - Kirei and the Linear Function |
25D - Roads not only in Berland | 1694A - Creep |
659F - Polycarp and Hay | 1040A - Palindrome Dance |
372A - Counting Kangaroos is Fun | 1396B - Stoned Game |
16A - Flag | 1056A - Determine Line |
670B - Game of Robots | 1418C - Mortal Kombat Tower |
1382B - Sequential Nim | 1272C - Yet Another Broken Keyboard |
808A - Lucky Year | 1245A - Good ol' Numbers Coloring |
58B - Coins | 1041C - Coffee Break |
507A - Amr and Music | 1041D - Glider |
1486A - Shifting Stacks | 1389B - Array Walk |
71B - Progress Bar | 701A - Cards |