#include "bits/stdc++.h"
using namespace std;
typedef long long ll;
typedef long double ld;
typedef vector<ll> vi;
typedef pair<ll, ll> pi;
#define FOR(i, j, k) for (ll i = j; i < (ll) k; ++i)
#define FORD(i, j, k) for (ll i = j; i >= (ll) k; --i)
#define nl "\n"
#define all(x) (x).begin(), (x).end()
#define sc second
#define fr first
#define pb push_back
string add(string a, string b) {
if(a.length() < b.length()) swap(a, b);
while(b.length() < a.length())
b = "0" + b;
string ans;
int carry = 0;
FORD(i, a.length() - 1, 0) {
int c = (a[i] - '0') + (b[i] - '0') + carry;
char num = (char) (c % 10 + (int)('0'));
ans = num + ans;
carry = c / 10;
}
if(carry) {
char num = (char) (carry + (int)('0'));
ans = num + ans;
}
return ans;
}
void solve()
{
int n;
cin >> n;
int a[n][n];
FOR(i, 0, n){
FOR(j, 0, n) {
cin >> a[i][j];
}
}
string dp[n][n] = {};
FOR(i, 0, n) {
FOR(j, 0, n) {
dp[i][j] = "0";
}
}
dp[0][0] = "1";
FOR(i, 0, n) {
FOR(j, 0, n) {
if(a[i][j] == 0)
continue;
if(i + a[i][j] < n)
dp[i + a[i][j]][j] = add(dp[i][j], dp[i + a[i][j]][j]);
if(j + a[i][j] < n)
dp[i][j + a[i][j]] = add(dp[i][j], dp[i][j + a[i][j]]);
}
}
// FOR(i, 0, n) {
// FOR(j, 0, n){
// cout << dp[i][j] << " ";
// }
// cout << nl;
// }
cout << dp[n - 1][n - 1] << nl;
}
signed main()
{
ios_base::sync_with_stdio(false);
cin.tie(NULL);
ll t = 1;
// cin >> t;
while (t--)
{
solve();
}
}
