#include using namespace std; #define rep(i,n) for(ll i=0;i=0;i--) #define perl(i,r,l) for(ll i=r-1;i>=l;i--) #define fi first #define se second #define pb push_back #define ins insert #define pqueue(x) priority_queue,greater> #define all(x) (x).begin(),(x).end() #define CST(x) cout<; using vvl=vector>; using pl=pair; using vpl=vector; using vvpl=vector; const ll MOD=1000000007; const ll MOD9=998244353; const int inf=2e9+1; const ll INF=4e18; const ll dy[8]={-1,0,1,0,1,1,-1,-1}; const ll dx[8]={0,-1,0,1,1,-1,1,-1}; template inline bool chmax(T &a, T b) { return ((a < b) ? (a = b, true) : (false)); } template inline bool chmin(T &a, T b) { return ((a > b) ? (a = b, true) : (false)); } bool iskd(ll a,ll b,ll c){ if(a==b||b==c||c==a)return false; if(ac)return true; if(a>b&&b> n; vvl mat(3,vl(3)); vl x,y; rep(i,3){ rep(j,3){ cin >> mat[i][j]; if(mat[i][j]==0){ x.push_back(i);y.push_back(j); } } } vl st={1,n-1,n}; rep(i,3)rep(j,3){ st.push_back(mat[i][j]-1); st.push_back(mat[i][j]); st.push_back(mat[i][j]+1); st.push_back(n-mat[i][j]-1); st.push_back(n-mat[i][j]); st.push_back(n-mat[i][j]+1); } sort(all(st));st.erase(unique(all(st)),st.end()); //for(auto p:st)cout << p <<" ";cout << endl; ll ans=0; rep(i,st.size()-1){ mat[x[0]][y[0]]=st[i]; mat[x[1]][y[1]]=n-st[i]; if(isok(mat)){ ans+=st[i+1]-st[i]; //cout << st[i] << endl; } } cout << ans << endl; /*ll ret=0; for(int i=1;i> t; while(t--){ solve(); } }