#include #pragma GCC optimize("unroll-loops") using namespace std; using std::cout; using std::cin; using std::endl; using ll=long long; using ld=long double; const ll ILL=2167167167167167167; const int INF=2100000000; const int mod=998244353; #define rep(i,a,b) for (int i=(int)(a);i<(int)(b);i++) #define all(p) p.begin(),p.end() template 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,T b){if(a>b){a=b;return 1;}else return 0;} template bool chmax(T &a,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,bool upp=0){if(a) cout<<(upp?"YES\n":"Yes\n"); else cout<<(upp?"NO\n":"No\n");} template void vec_out(vector &p,int ty=0){ if(ty==2){cout<<'{';for(int i=0;i<(int)p.size();i++){if(i){cout<<",";}cout<<'"'< T vec_min(vector &a){assert(!a.empty());T ans=a[0];for(auto &x:a) chmin(ans,x);return ans;} template T vec_max(vector &a){assert(!a.empty());T ans=a[0];for(auto &x:a) chmax(ans,x);return ans;} template T vec_sum(vector &a){T ans=T(0);for(auto &x:a) ans+=x;return ans;} int pop_count(long long a){int res=0;while(a){res+=(a&1),a>>=1;}return res;} 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]; set> s; vector dx={2,2,-2,-2,-1,1,-1,1}; vector dy={-1,1,-1,1,-2,-2,2,2}; auto f=[&](int ind,int k=-1) -> pair { if(k<0) return {X[ind],Y[ind]}; return {X[ind]+dx[k],Y[ind]+dy[k]}; }; vector G(N,vector>>(N)); rep(i,0,N) rep(j,i+1,N){ rep(k,0,8) rep(l,0,8){ if(f(i,k)==f(j,l)) G[i][j].push_back(f(i,k)); } } rep(i,0,N) s.insert(f(i)); int ans=-1; auto op=[&](auto self,int ind,int num,int val,int t) -> void { if(ans-val>=(N-ind)/2) return; if(ind==N){ chmax(ans,val); return; } if(num&(1<