#include <bits/stdc++.h>

using namespace std;
using ll = long long int;

int p[100100];

vector<int> g[100100];
int f[100100];

pair<int,int> s[100100];

void dfs(int node){
    s[node] = {p[node], p[node]};
    for(auto i : g[node]){
        dfs(i);
        int l = s[i].first, r = s[i].second;
        if(l != -1 && r != -1){
            if(l == 0){
                ++l;
            }
            else{
                --l;
            }
            ++r;
            if(s[node].first == -1){
                s[node] = {l, r};
            }
            else if(s[node].first % 2 != l % 2 || r < s[node].first || l > s[node].second){
                cout << "NEM" << endl;
                exit(0);
            }
            if(p[node] == -1){
                s[node].first = max(s[node].first, l);
                s[node].second = min(s[node].second, r);
            }
        }
    }
}

void c(int node){
    if(p[node] == -1){
        int l = s[node].first, r = s[node].second;
        if(l <= p[f[node]] - 1 && r >= p[f[node]] - 1 && p[f[node]] - 1 >= 0){
            p[node] = p[f[node]] - 1;
        }
        else{
            p[node] = p[f[node]] + 1;
        }
    }
    for(auto i : g[node]){
        c(i);
    }
}

int main(){
    int n;
    cin >> n;
    for(int i = 1;  i <= n; ++i){
        cin >> f[i];
        g[f[i]].push_back(i);
    }
    for(int i = 1;  i <= n; ++i){
        cin >> p[i];
    }
    dfs(1);
    if(p[1] == -1){
        p[1] = s[1].first;
    }
    c(1);
    cout << "IGEN" << endl;
    for(int i = 1; i <= n; ++i){
        cout << p[i] << " ";
    }
    return 0;
}