For this Question: You are given a multiset (i. e. a set that can contain multiple equal integers) containing 2n integers. Determine if you can split it into exactly n pairs (e.g. each element should be in exactly one pair) so that the sum of the two elements in each pair is odd (i. e. when divided by 2, the remainder is 1).The first line of input contains an integer n. The second line of the input contains 2n integers a<sub>1</sub>, a<sub>2</sub>, …, a<sub>2n</sub>, (0≤ai≤100) denoting the numbers in the set.

<b>Constraints</b>
1 &le; n &le; 100
0 &le; a<sub>i</sub> &le; 100Print "Yes" if it can be split into exactly n pairs so that the sum of the two elements in each pair is odd, and "No" otherwise.<b>Sample Input 1</b>
2
2 3 4 5
<b>Sample Output 1</b>
Yes

<b>Sample Input 2</b>
3
2 3 4 5 5 5
<b>Sample Output 2</b>
No, I have written this Solution Code: #include <bits/stdc++.h>
using i64 = long long;
int main() {
    std::ios::sync_with_stdio(false);
    std::cin.tie(nullptr);
    int t=1;
 //   std::cin >> t;
    while (t--) {
        int n;
        std::cin >> n;
        int odd = 0;
        for (int i = 0; i < 2 * n; i++) {
            int x;
            std::cin >> x;
            if (x % 2 == 1) {
                odd++;
            }
        }
        if (odd == n) {
            std::cout << "Yes\n";
        } else {
            std::cout << "No\n";
        }
    }
    return 0;
}, In this Programming Language: C++, Now tell me if this Code is compilable or not?