#include using namespace std; // clang-format off namespace viewer {templatestring f(T i){string s=(i==1001001001||i==1001001001001001001?"inf":to_string(i));s=string(max(0,3-(int)s.size()),' ')+s;return s;} void view(const char c,string end="\n"){cerr<void view(const T&x,string end="\n"){cerr<void view(const pair&p,string end="\n"){cerr<<"("<(p))<<", "<(p))<<")"<void view(const tuple&p,string end="\n"){cerr<<"("<(p))<<", "<(p))<<")"<void view(const tuple&t,string end="\n"){cerr<<"("<(t))<<", "<(t));cerr<<", "<(t))<<")"<void view(const tuple&t,string end="\n"){cerr<<"("<(t))<<", "<(t))<<", "<(t))<<", "<(t))<<")"<void view(const vector&vx,string _end=""){bool is_value=is_integral();cerr<<"{"<<(vx.empty()||is_value?"":"\n");for(const T&x:vx){if(!is_value)cerr<<" ";view(x,(is_value?",":"\n"));};cerr<<"}\n"<<_end;} templatevoid view(const set&s){vectorv(s.begin(),s.end());view(v);} templatevoid view(const multiset&s){vectorv(s.begin(),s.end());view(v);} templatevoid view(const unordered_set&s){vectorv(s.begin(),s.end());view(v);} templatevoid view(const deque&s){vectorv(s.begin(),s.end());view(v);} templatevoid view(const priority_queue&p){priority_queueq=p;vectorv;while(!q.empty()){v.push_back(q.top());q.pop();}view(v);} templatevoid view(const map&m){cerr<<"{"<<(m.empty()?"":"\n");for(const auto&kv:m){cerr<<" [";view(kv.first,"");cerr<<"] : ";view(kv.second,"");cerr<<"\n";}cerr<<"}\n";} templatevoid _view(const T&var,string var_name,int line_num){cerr<&vb:vvb){for(const bool&b:vb)cerr<<(b?".":"#");cerr<<"\n";}}} //グリッド用 "."と"#"は交換可 // clang-format on #define chmax(a, b) a = (((a) < (b)) ? (b) : (a)) #define chmin(a, b) a = (((a) > (b)) ? (b) : (a)) #define debug(var) viewer::_view(var, #var, __LINE__) constexpr int INF = 1001001001; int main() { cin.tie(0); ios::sync_with_stdio(false); int N; cin >> N; vector As(2 * N + 1); for (int i = 0; i < 2 * N + 1; i++) { cin >> As[i]; } int cnt = 0; while (As.size() >= 3 && cnt++ <= 3) { vector Bs((int)As.size() - 2); for (int i = 1; i < (int)As.size() - 1; i++) { if (As[i - 1] == 0 && As[i] == 1 && As[i + 1] == 2) { Bs[i - 1] = 1; } else if (As[i - 1] == 1 && As[i] == 2 && As[i + 1] == 0) { Bs[i - 1] = 1; } else if (As[i - 1] == 2 && As[i] == 0 && As[i + 1] == 1) { Bs[i - 1] = 1; } else if (As[i - 1] == 2 && As[i] == 1 && As[i + 1] == 0) { Bs[i - 1] = 2; } else if (As[i - 1] == 1 && As[i] == 0 && As[i + 1] == 2) { Bs[i - 1] = 2; } else if (As[i - 1] == 0 && As[i] == 2 && As[i + 1] == 1) { Bs[i - 1] = 2; } else { Bs[i - 1] = 0; } } swap(As, Bs); // debug(As); } if (As.size() == 1) { cout << As[0] << endl; return 0; } bool is_0 = false; bool is_1 = false; bool is_2 = false; for (int i = 0; i < int(As.size()); i++) { if (As[i] == 0) { is_0 = true; } else if (As[i] == 1) { is_1 = true; } else { is_2 = true; } } assert(!(is_0 && is_1 && is_2)); // 未証明 cout << 0 << endl; return 0; }