#include<bits/stdc++.h>
using namespace std;

int a[4],b[4],c[4],d[4];

int main()
{
    ios::sync_with_stdio(0);
    for(int i = 0;i < 4;i++)    cin >> a[i] >> b[i] >> c[i] >> d[i];
    int flag = 0;
    for(int i = 0;i < 4;i++)
    {
        if(!d[i])   continue;
        if(a[i] || b[i] || c[i] || a[(i+1)%4] || b[(i+2)%4] || c[(i+3)%4])  flag = 1;
    }
    if(flag)    cout << "YES" << endl;
    else    cout << "NO" << endl;
    return 0;
}

#include<bits/stdc++.h>
using namespace std;

int n,m,dp[2][20] = {0};
string s[20];

int main()
{
    ios::sync_with_stdio(0);
    cin >> n >> m;
    for(int i = 1;i <= n;i++)
    {
        cin >> s[i];
        s[i] = " "+s[i];
    }
    int t;
    for(t = 1;t <= n;t++)
    {
        int flag = 0;
        for(int j = 1;j <= m+2;j++)
        {
            if(s[t][j] == ‘1‘)  flag = 1;
        }
        if(flag)    break;
    }
    if(t == n+1)
    {
        cout << 0 << endl;
        return 0;
    }
    dp[0][n+1] = -1;
    dp[1][n+1] = 1e9;
    for(int i = n;i >= t;i--)
    {
        int l = m+2;
        int r = 1;
        for(int j = m+2;j >= 1;j--)
        {
            if(s[i][j] == ‘1‘)  l = j;
        }
        for(int j = 1;j <= m+2;j++)
        {
            if(s[i][j] == ‘1‘)  r = j;
        }
        if(i == t)
        {
            cout << min(dp[0][i+1]+r,dp[1][i+1]+m+3-l) << endl;
            return 0;
        }
        dp[0][i] = min(dp[1][i+1]+m+2,dp[0][i+1]+2*(r-1)+1);
        dp[1][i] = min(dp[0][i+1]+m+2,dp[1][i+1]+2*(m+2-l)+1);
    }
    return 0;
}

#include<bits/stdc++.h>
using namespace std;

int n,s;
long long a[100005],b[100005];

bool ok(int x)
{
    for(int i = 1;i <= n;i++)   b[i] = a[i]+(long long)x*i;
    sort(b+1,b+1+n);
    long long sum = 0;
    for(int i = 1;i <= x;i++)   sum += b[i];
    return sum <= s;
}
int main()
{
    ios::sync_with_stdio(0);
    cin >> n >> s;
    for(int i = 1;i <= n;i++)   cin >> a[i];
    int l = 0,r = n;
    while(l < r)
    {
        int mid = (l+r+1)/2;
        if(ok(mid)) l = mid;
        else    r = mid-1;
    }
    for(int i = 1;i <= n;i++)   b[i] = a[i]+(long long)l*i;
    sort(b+1,b+1+n);
    long long sum = 0;
    for(int i = 1;i <= l;i++)   sum += b[i];
    cout << l << " " << sum << endl;
    return 0;
}

#include<bits/stdc++.h>
using namespace std;

int n,m,k,q,cnt = 0,pre[100005] = {0},l[100005],r[100005],ok[100005] = {0},sum[100005];
vector<int> v[100005];

void dfs(int now)
{
    ++cnt;
    l[now] = cnt;
    sum[now] = 1;
    for(int i = 0;i < v[now].size();i++)
    {
        int t = v[now][i];
        dfs(t);
        sum[now] += sum[t];
    }
    r[now] = cnt;
}
int main()
{
    ios::sync_with_stdio(0);
    cin >> n >> m >> k >> q;
    while(k--)
    {
        int x,y;
        cin >> x >> y;
        if(pre[y] != 0)
        {
            v[pre[y]].push_back(x);
            ok[x] = 1;
        }
        pre[y] = x;
    }
    for(int i = 1;i <= n;i++)
    {
        if(!ok[i])  dfs(i);
    }
    while(q--)
    {
        int x,y;
        cin >> x >> y;
        if(pre[y] && l[x] <= l[pre[y]] && r[pre[y]] <= r[x])    cout << sum[x] << endl;
        else    cout << 0 << endl;
    }
    return 0;
}

#include<bits/stdc++.h>
using namespace std;

int n,a[200005],h[200005];
map<int,int> mp;
vector<int> v[200005];

void dfs(int now)
{
    int x = 0;
    for(int i = 0;i < v[now].size();i++)
    {
        int t = v[now][i];
        dfs(t);
        x = max(h[t],x);
    }
    h[now] = x+1;
}

int main()
{
    ios::sync_with_stdio(0);
    cin >> n;
    for(int i = 1;i <= n;i++)   cin >> a[i];
    for(int i = 2;i <= n;i++)
    {
        int x;
        cin >> x;
        v[x].push_back(i);
    }
    dfs(1);
    int ok = 0,cnt1 = 0;
    for(int i = 1;i <= n;i++)
    {
        if(h[i]%2)
        {
            ok ^= a[i];
            cnt1++;
            mp[a[i]]++;
        }
    }
    int cnt2 = n-cnt1;
    long long ans = 0;
    if(ok == 0) ans = (long long)cnt1*(cnt1-1)/2+(long long)cnt2*(cnt2-1)/2;
    for(int i = 1;i <= n;i++)
    {
        if(h[i]%2 == 0) ans += mp[ok^a[i]];
    }
    cout << ans << endl;
    return 0;
}