#include<bits/stdc++.h>
using namespace std;
bool M1;
#define task "aws"
#define sz(a) (int)a.size()
#define all(x) x.begin(),x.end()
#define ii pair<int,int>
#define iii pair<int,ii>
#define iv pair<ii,ii>
#define se second
#define fi first
#define ffi fi.fi
#define sfi se.fi
#define sse se.se
#define fse fi.se
#define lt(i, c, d) for(int i = c; i <= d; ++i)
#define fl(i, c, d) for(int i = d; i >= c; --i)
#define pb push_back
#define emb emplace_back
#define emf emplace_front
#define em emplace
#define look_memory cerr<<abs(&M2-&M1)/1024.0/1024<<'\n'
#define look_time cerr << "TIME : " << clock() * 0.001 << "s" <<'\n'
const int N=1e3+5,lg=30,mod=1e9+7;
mt19937 rd(chrono::steady_clock::now().time_since_epoch().count());
int Rand(int u,int v){
return u+rd()%(v-u+1);
}
int dx[]={1,0,-1,0,1,1,-1,-1};
int dy[]={0,-1,0,1,1,-1,1,-1};
long long node,a[N][N],dp[N][N];
bool check(int x,int y){
return x>=1&&x<=node&&y>=1&&y<=node;
}
bool M2;
void solve(){
cin >> node;
for(int i=1;i<=node;++i)for(int j=1;j<=node;++j)cin >> a[i][j];
dp[1][1]=1;
for(int i=1;i<=node;++i){
for(int j=1;j<=node;++j){
if(a[i][j]==0)continue;
int u=i,v=j+a[i][j];
if(check(u,v))dp[u][v]+=dp[i][j];
u=i+a[i][j],v=j;
if(check(u,v))dp[u][v]+=dp[i][j];
}
}
// for(int i=1;i<=node;++i){
// for(int j=1;j<=node;++j){
// cerr<<dp[i][j]<<" ";
// }
// cerr<<'\n';
// }
cout <<dp[node][node];
}
main()
{
srand(time(0));
ios_base::sync_with_stdio(false);
cin.tie(NULL);
cout.tie(NULL);
if(fopen(task".inp","r")){
freopen(task".inp","r",stdin);
freopen(task".out","w",stdout);
}
int t=1;
// cin >> t;
while(t--){
solve();cout<<'\n';
}
look_memory;
look_time;
}
