#include using namespace std; typedef signed long long ll; #define _P(...) (void)printf(__VA_ARGS__) #define FOR(x,to) for(x=0;x<(to);x++) #define FORR(x,arr) for(auto& x:arr) #define FORR2(x,y,arr) for(auto& [x,y]:arr) #define ALL(a) (a.begin()),(a.end()) #define ZERO(a) memset(a,0,sizeof(a)) #define MINUS(a) memset(a,0xff,sizeof(a)) template bool chmax(T &a, const T &b) { if(a bool chmin(T &a, const T &b) { if(a>b){a=b;return 1;}return 0;} //------------------------------------------------------- int N; int X[12],Y[12]; int dp[1<<12][12][12]; int on(int a,int b,int c) { int dx=X[b]-X[a]; int dy=Y[b]-Y[a]; int ex=X[c]-X[b]; int ey=Y[c]-Y[b]; int g=__gcd(abs(dx),abs(dy)); dx/=g; dy/=g; g=__gcd(abs(ex),abs(ey)); ex/=g; ey/=g; return dx==ex&&dy==ey; } int sgn(int a,int b,int c,int d) { int dx=X[b]-X[a]; int dy=Y[b]-Y[a]; int ex=X[d]-X[c]; int ey=Y[d]-Y[c]; int z=dx*ey-dy*ex; if(z<0) return -1; if(z>0) return 1; return 0; } void solve() { int i,j,k,l,r,x,y; string s; cin>>N; FOR(i,N) { cin>>X[i]>>Y[i]; } if(N==1) { cout<<1<