For this Question: You are given two arrays A and B of size N each. You can perform any of the following operation any number of times:
<ul>
<li>Choose any index i (1 <= i <= N) and increase A<sub>i</sub> by 1 and decrease B<sub>i</sub> by 1</li>
<li>Choose any index i (1 <= i <= N) and decrease A<sub>i</sub> by 1 and increase B<sub>i</sub> by 1</li>
</ul>
Find out whether you can make the corresponding elements of both arrays equal.The first line of the input contains a single integer N.
The second line of the input contains N space seperated integers A<sub>i</sub>
The third line of the input contains N space seperated integers B<sub>i</sub>

Constraints:
1 <= N <= 10<sup>5</sup>
1 <= A<sub>i</sub>, B<sub>i</sub> <= 10<sup>9</sup>Print "YES" if you can make the corresponding elements of both arrays equal in any number of moves, else print "NO"Sample Input:
5
3 7 6 4 2
5 7 4 4 2

Sample Output:
YES

Explaination:
First, we apply the second type of move on index i = 3 and then we apply the first type of move on index i = 1., I have written this Solution Code: #include<bits/stdc++.h>
using namespace std;
#define int long long

signed main(){
    int n;
    cin >> n;
    vector<int> a(n), b(n);
    for(auto &i : a) cin >> i;
    for(auto &i : b) cin >> i;
    for(int i = 0; i < n; i++){
        if(abs(a[i] - b[i]) % 2){
            cout << "NO";
            return 0;
        }
    }
    cout << "YES";
}, In this Programming Language: C++, Now tell me if this Code is compilable or not?