#ccf小明種蘋果 (續)
n =int(input())
a, d =[],[]for i inrange(n):
a.append(list(map(int,input().split())))
t, p, k =0,0,0for i inrange(n):
a[i].append(0)
temp = a[i][1]if a[i][0]>=1:for j inrange(2, a[i][0]+1):if a[i][j]<=0:
temp += a[i][j]else:#if temp > a[i][j] and len(d)>0 and d[-1]!=i: #len(d)>0導致第一次加不上if temp > a[i][j]and(len(d)==0or(len(d)>0and d[-1]!= i)):
d.append(i)#一棵樹掉幾次的情況???
temp = a[i][j]
a[i][-1]= temp
for i inrange(n):
t += a[i][-1]
e =0for i inrange(len(d)-2):if d[i +1]== d[i]+1and d[i +2]== d[i +1]+1: e +=1iflen(d)>=3:if d[0]==0and d[1]==1and d[-1]== n -1:
e +=1if d[0]==0and d[-2]== n -2and d[-1]== n -1:
e +=1print(t,len(d), e)