#include <bits/stdc++.h>
using namespace std;
#define LL long long
#define MP(a, b) make_pair(a, b)
const int MAXN = 10000 + 10;
const int INF = 0x3f3f3f3f;
 
int dp[MAXN], ans[MAXN];
 
int main()
{
    //freopen("input.txt", "r", stdin);
    int n, i, j, cur, a, vmax = -1;
    scanf("%d", &n);
    for (i = 0; i < n; i++)
    {
        cur = 0;
        memset(dp, 0, sizeof dp);
        while (scanf("%d", &a), a != -1)
        {
            dp[0] = 1;
            for (j = cur; j >= 0; j--)
                dp[j + a] |= dp[j];
            cur += a;
        }
        vmax = max(vmax, cur);
        for (j = vmax; j >= 1; j--)
            dp[j] ? ans[j]++ : 0;
    }
    for (i = vmax; i >= 1; i--)
        if (ans[i] == n)
        {
            printf("%d\n", i);
            return 0;
        }
    printf("0\n");
    return 0;
}