#include using namespace std; #define F first #define S second #define R cin>> #define Z class #define ll long long #define ln cout<<'\n' #define in(a) insert(a) #define pb(a) push_back(a) #define pd(a) printf("%.10f\n",a) #define mem(a) memset(a,0,sizeof(a)) #define all(c) (c).begin(),(c).end() #define iter(c) __typeof((c).begin()) #define rrep(i,n) for(ll i=(ll)(n)-1;i>=0;i--) #define REP(i,m,n) for(ll i=(ll)(m);i<(ll)(n);i++) #define rep(i,n) REP(i,0,n) #define tr(it,c) for(iter(c) it=(c).begin();it!=(c).end();it++) templatevoid pr(A a){cout<void pr(A a,B b){cout<void pr(A a,B b,C c){cout<void pr(A a,B b,C c,D d){cout<void PR(A a,ll n){rep(i,n){if(i)cout<<' ';cout<=0&&x=0&&y P; int hungarian(vector > a) { int n=a.size(),p,q,INF=1<<29; vector fx(n,INF),fy(n,0); vector x(n,-1),y(n,-1); for(int i=0;i t(n,-1),s(n+1,i); for(p=q=0;p<=q&&x[i]<0;p++) for(int k=s[p],j=0;j=0;j=p) y[j]=k=t[j],p=x[k],x[k]=j; } if(x[i]<0) { int d=INF; for(int k=0;k<=q;k++) for(int j=0;j> n; vector a(n); rep(i,n) cin >> a[i]; vector > b(n,vector(n)); rep(i,n) { rep(j,n) { if(i==j) b[i][j]=-MAX; else b[i][j]=a[i]^a[j]; } } pr(hungarian(b)/2); } int main(){ios::sync_with_stdio(0);cin.tie(0);Main();return 0;}