#include using namespace std; #define ALL(a) (a).begin(),(a).end() #define ALLR(a) (a).rbegin(),(a).rend() #define spa << " " << #define lfs <= (ll)(m); i--) typedef long long ll; typedef long double ld; const ll MOD = 1e9+7; //const ll MOD = 998244353; const ll INF = 1e18; using P = pair; template void chmin(T &a,T b){if(a>b)a=b;} template void chmax(T &a,T b){if(a void ans(bool x,T1 y,T2 z){if(x)cout< void debug(vector>v,ll h,ll w){for(ll i=0;iv,ll h,ll w){for(ll i=0;i void debug(vectorv,ll n){cout< vector>vec(ll x, ll y, T w){ vector>v(x,vector(y,w));return v;} ll gcd(ll x,ll y){ll r;while(y!=0&&(r=x%y)!=0){x=y;y=r;}return y==0?x:y;} template void emp(map&m, T x){m.emplace(x,0).first->second++;} int main(){ cin.tie(NULL); ios_base::sync_with_stdio(false); ll res=0,res1=INF,res2=-INF,buf=0; bool judge = true; auto v=vec(100,100,0); v[2][8]=1; v[3][9]=2; v[7][9]=3; ll n;cin>>n; vectorx(2*n),y(2*n); rep(i,0,2*n)cin>>x[i]>>y[i]; rep(i,0,n){ ll ax=x[2*i],ay=y[2*i],bx=x[2*i+1],by=y[2*i+1]; v[bx][by]=v[ax][ay]; v[ax][ay]=0; } ans2(v[5][8]==1&&v[4][8]==2&&v[6][8]==3); //debug(v,10,10); return 0; }