#include<iostream>

 #include<cstdio>

 #include<queue>

 #include<algorithm>

 #include<cmath>

 #include<ctime>

 #include<set>

 #include<map>

 #include<stack>

 #include<cstring>

 #define inf 2147483647

 #define For(i,a,b) for(register int i=a;i<=b;i++)

 #define p(a) putchar(a)

 #define g() getchar()

 //by war

 //2017.11.7

 using namespace std;

 bool xuse[][],yuse[][];

 int a[][];

 int ans,n=;

 int tot;

 void in(int &x)

 {

     char c=g();x=;

     while(c<''||c>'')c=g();

     while(c<=''&&c>='')x=(x<<)+(x<<)+c-'',c=g();

 }

 void o(int x)

 {

     if(x>)o(x/);

     p(x%+'');

 }

 inline bool test(register int step,register int num)

 {

     register int x=(step/)/*;

     register int y=(step%)/*;

     For(i,,)

       For(j,,)

         if(a[x+i][y+j]==num)

         return false;

         return true;

 }

 inline int get()

 {

     int cnt=;

     int t=;

     For(len,,)

     {

         t++;

         For(j,len,n-len)

         cnt+=a[len][j]*t;

         if(len==)

         break;

         For(j,len,n-len)

         cnt+=a[n-len][j]*t;

         For(i,len+,n-len-)

         cnt+=a[i][len]*t;

         For(i,len+,n-len-)

         cnt+=a[i][n-len]*t;

     }

     return cnt;

 }

 inline void dfs(register int step)

 {

     if(step==)

     {

     ans=max(get(),ans);

     tot++;

     return;

     }

     if(a[step/][step%]!=)

     dfs(step+);

     else

     for(register int i=;i>=;i--)

     {

         if(!xuse[step/][i]&&!yuse[step%][i]&&test(step,i))

         {

             a[step/][step%]=i;

             xuse[step/][i]=true;

             yuse[step%][i]=true;

             dfs(step+);

             a[step/][step%]=;

             xuse[step/][i]=false;

             yuse[step%][i]=false;

         }

     }

 }

 int main()

 {

     for(register int i=;i>=;i--)

       For(j,,)

         {

             in(a[i][j]);

             if(a[i][j]!=)

             {

                 xuse[i][a[i][j]]=true;

                 yuse[j][a[i][j]]=true;

             }

         }

     dfs();

     if(ans!=)

     o(ans);

     else

     puts("-1");

      return ;

 }