Maximum Number of Balls – Triangle

Maximum Number of Balls – Triangle: In a game, there are (N*(N+1))/2 boxes arranged as a triangle based on the following conditions.
– N boxes in the N^th row.
– N-1 boxes in the (N-1)^th row.
– N-2 boxes in the (N-2)^th row.
– N-3 boxes in the (N-3)^th row.
– Similarly, the remaining boxes are arranged as a triangle.
Each box contains a certain number of balls. The number of balls in each box is passed as the input. The program must print the maximum number of balls that can be collected from the boxes based on the following condition.
– The only box in the 1st row must be picked. For the remaining rows, one of the two adjacent boxes in the next row to the previously selected box must be picked.

Boundary Condition(s):
3 <= N <= 100
1 <= Number of balls in each box <= 10^5

Input Format:
The first line contains N.
The next N lines containing the triangle, where the asterisks in each row represent the empty spaces.

Output Format:
The first line contains an integer representing the maximum number of balls that can be collected from the boxes.

Example Input/Output 1:
Input:
4
***3
**4 2
*7 6 9
5 2 9 4

Output:
23

Explanation:
The maximum number of balls that be collected from the boxes is 23 (3 + 2 + 9 + 9).
1^st row: 3
2^nd row: 2
3^rd row: 9
4^th row: 9

Example Input/Output 2:
Input:
7
******22
*****7 2
****19 18 7
***6 22 34 35
**13 24 18 1 25
*2 6 2 39 42 19
24 9 3 21 16 13 21

Output:
159

Explanation:
The maximum number of balls that be collected from the boxes is 159 (22 + 7 + 18 + 34 + 18 + 39 + 21).
1^st row: 22
2^nd row: 7
3^rd row: 18
4^th row: 34
5^th row: 18
6^th row: 39
7^th row: 21

n=int(input())
box=[list(map(int,input().strip('*').split())) for i in range(n)]
m=0
for i in range(n-2,-1,-1):
    for j in range(0,len(box[i])):
        box[i][j]+=max(box[i+1][j],box[i+1][j+1])
print(box[0][0])