int triangle[101][101];
int dp[101][101];

int path(int y, int x)
{
    memset(dp, 0, sizeof(dp) );
    dp[1][1] = triangle[1][1];
    for (int j = 2; j <= y; j++)
    {
        for (int i = 2; i <= x; i++)
        {
            if (j >= i)
                dp[j][i] = triangle[j][i] + max(dp[j-1][i], dp[j-1][i-1]);
        }
    }
    return dp[y][x];
}

int MAIN()
{
    vector <int> res;
    int tc; cin >> tc;
    while (tc--)
    {
        int n; cin >> n;
        for (int j = 1; j <= n; j++)
            for (int i = 1; i <= j; i++)
                cin >> triangle[j][i];

        int maxi = numeric_limits<int>::min();
        for (int x = 1; x <= n; x++)
            maxi = max(maxi, path(n, x) );

        res.push_back(maxi);
    }
    for (size_t i = 0; i < res.size(); i++)
        cout << res[i] << endl;
    return 0;
}