class bird:
    def __init__(self, x, y):

        self.x = x
        self.y = y



n = int(input())


pole = []

for y in range (n):


    inp = input().split()
    for i in range(len(inp)-1):
        temp = int(inp[i+1])
        #m.append(int(inp[i]))

        birdos = bird(y,int(inp[i+1]))
        pole.append(birdos)


#for i in range(len(pole)):

 #   print(pole[i].x)
  #  print(pole[i].y)
   # print()
    
pocet = 0

for i in range(len(pole)):

    for k in range(len(pole)-i):

        if (pole[i].x < pole[k+i].x):
            if (pole[i].y > pole[k+i].y):
                pocet+=1

print(pocet)