#include<iostream> #include<vector> using namespace std; int n, t, a[30]; vector<int> b[30], in; bool s = false; void f(int x){ if(s) return; if(x == n){ for(int i = 0; i < n; i++){ for(int j = 0; j < b[i+1].size(); j++){ if(a[i] == a[b[i+1][j]-1]){ return; } } } for(int i = 0; i < n; i++) cout << a[i] << ' '; s = true; return; } for(int i = 1; i <= 4; i++){ a[x] = i; f(x + 1); } } int main(){ cin >> n; while(cin >> t){in.push_back(t);} int j = n; for(int i = in.size() - 1; i >= 0; i--){ if(j != in[i]) b[j].push_back(in[i]); if(j == in[i]) j--; } f(0); return 0; }