#include <algorithm>
#include <iostream>
using namespace std;
int f[9]={2,4,5,6,7,9,10,11,12};
int x[6];
int main(){
do{
bool error =false;
int m,n;
x[0]=8+f[0]+f[7]+3;
x[1]=f[8]+1+f[0]+f[1];
x[2]=8+f[1]+f[2]+f[3];
x[3]=1+f[2]+f[4]+f[5];
x[4]=3+f[3]+f[4]+f[6];
x[5]=f[5]+f[6]+f[7]+f[8];
for(m=0;m<=4;m++){
for(n=m+1;n<=5;n++){
if(x[m]!=x[n]){
error=true;
break;
}
}
if(error) break;
}
if(m==5&&n==6&&error==false)
cout<<f[0]<<endl;
}while(next_permutation(f,f+9));
return 0;
}
#include <iostream>
using namespace std;
int f[9]={2,4,5,6,7,9,10,11,12};
int x[6];
int main(){
do{
bool error =false;
int m,n;
x[0]=8+f[0]+f[7]+3;
x[1]=f[8]+1+f[0]+f[1];
x[2]=8+f[1]+f[2]+f[3];
x[3]=1+f[2]+f[4]+f[5];
x[4]=3+f[3]+f[4]+f[6];
x[5]=f[5]+f[6]+f[7]+f[8];
for(m=0;m<=4;m++){
for(n=m+1;n<=5;n++){
if(x[m]!=x[n]){
error=true;
break;
}
}
if(error) break;
}
if(m==5&&n==6&&error==false)
cout<<f[0]<<endl;
}while(next_permutation(f,f+9));
return 0;
}