#include #include #include #include #include using namespace std; typedef vector > Graph; #define VAR(x) ((x) << 1) #define NOT(x) ((x) ^ 1) void visit(int v, const Graph &g, vector &ord, vector &num, int k) { if (num[v] >= 0) return; num[v] = k; for (int i = 0; i < g[v].size(); ++i) visit(g[v][i], g, ord, num, k); ord.push_back(v); } typedef pair clause; void two_satisfiability(int m, const vector &cs, vector &num) { int n = m * 2; // m positive vars and m negative vars Graph g(n), h(n); for (int i = 0; i < cs.size(); ++i) { int u = cs[i].first, v = cs[i].second; g[NOT(u)].push_back( v ); g[NOT(v)].push_back( u ); h[v].push_back( NOT(u) ); h[u].push_back( NOT(v) ); } vector ord, dro; num.resize(n); fill(num.begin(),num.end(),-1); for (int i = 0; i < n; ++i) visit(i, g, ord, num, i); reverse(ord.begin(), ord.end()); fill(num.begin(), num.end(), -1); for (int i = 0; i < n; ++i) visit(ord[i], h, dro, num, i); } int main(){ cin.tie(0); ios::sync_with_stdio(false); int N,i; cin>>N; if(N>52*52){ cout<<"Impossible"<<'\n'; return 0; } vectorv(N); for(int i=0;i>v[i]; vectorcs; for(int i=0;inum; two_satisfiability(N,cs,num); for(i=0;inum[NOT(VAR(i))]){ cout<