#include #pragma GCC optimize("Ofast") using namespace std; using std::cout; using std::cin; using std::endl; using ll=long long; using ld=long double; ll ILL=2167167167167167167; const int INF=2100000000; const int mod=998244353; #define rep(i,a,b) for (ll i=a;i using _pq = priority_queue, greater>; template ll LB(vector &v,T a){return lower_bound(v.begin(),v.end(),a)-v.begin();} template ll UB(vector &v,T a){return upper_bound(v.begin(),v.end(),a)-v.begin();} template bool chmin(T &a,const T &b){if(a>b){a=b;return 1;}else return 0;} template bool chmax(T &a,const T &b){if(a void So(vector &v) {sort(v.begin(),v.end());} template void Sore(vector &v) {sort(v.begin(),v.end(),[](T x,T y){return x>y;});} void yneos(bool a){if(a) cout<<"Yes\n"; else cout<<"No\n";} template void vec_out(vector &p){for(int i=0;i<(int)(p.size());i++){if(i) cout<<" ";cout< T min(vector &a){assert(!a.empty());T ans=a[0];for(auto &x:a) chmin(ans,x);return ans;} template T max(vector &a){assert(!a.empty());T ans=a[0];for(auto &x:a) chmax(ans,x);return ans;} template T sum(vector &a){assert(!a.empty());T ans=a[0]-a[0];for(auto &x:a) ans+=x;return ans;} void solve(); // oddloop int main() { ios::sync_with_stdio(false); cin.tie(nullptr); int t=1; //cin>>t; rep(i,0,t) solve(); } void solve(){ int N; cin>>N; vector X(N),Y(N); rep(i,0,N) cin>>X[i]>>Y[i]; auto f=[&](int a,int b)->pair{ int c=__gcd(abs(a),abs(b)); a/=c,b/=c; if(a<0) a*=-1,b*=-1; if(a==0&&b<0) b*=-1; return {a,b}; }; vector>> G(N,vector>(N)); rep(i,0,N) rep(j,0,N) if(i!=j) G[i][j]=f(X[i]-X[j],Y[i]-Y[j]); vector ok(1<> s; rep(j,0,N) rep(l,0,N){ if(j!=l&&((1< dp(1<=0;j--){ j&=T; if(ok[j]) chmin(dp[j+i],dp[i]+1); } } cout<