DP[i][j]=Max(DP[i-][j],DP[i-][j-])+a[i][j]

ans=Max(DP[n][..n])

#include <bits/stdc++.h>

#define rep(i,j,n) for(register int i=j;i<=n;i++)

using namespace std;

typedef long long LL;

inline LL read() { LL x=; int f=; char ch=getchar();

    while(!isdigit(ch)) { if (ch=='-') f=-; ch=getchar();}

    while(isdigit(ch)) x=(x<<)+(x<<)+(ch^),ch=getchar(); return x*f;

}

int n;

const int N=<<;

const int mod=;

LL a[N][N];

bool DP[N][N][N];

signed main(){

    n=read();

    rep(i,,n) rep(j,,i) a[i][j]=read()%mod;

    DP[][][a[][]]=;

    rep(i,,n) rep(j,,i) rep(k,,) if(DP[i][j][k]) {

        DP[i+][j][(k+a[i+][j])%mod]=;

        DP[i+][j+][(k+a[i+][j+])%mod]=;

    }

    for(register int k=;k>=;k--) rep(i,,n) if(DP[n][i][k]) {

        cout << k << endl ;

        return ;

    }

}