# def solution(n, lost, reserve):
# answer = 0
# k = len(lost)
# l = len(reserve)
# answer += n - k
# lost.sort()
# reserve.sort()
# for i in range(k):
# for j in range(l):
# if lost[i] == reserve[j]:
# answer += 1
# reserve[j] = -3
# lost[i] = -3
# for i in range(k):
# for j in range(l):
# if lost[i] - reserve[j] == 1:
# answer += 1
# reserve[j] = -3
# lost[i] = -3
# elif lost[i] - reserve[j] == -1:
# answer += 1
# reserve[j] = -3
# lost[i] = -3
# return answer
#
#
# z = int(input())
# los = list(map(int, input().split()))
# re = list(map(int, input().split()))
# print(solution(z, los, re))
# def solution(name):
# answer = 0
# k = len(name)
# na = [0] * k
# q = []
# for i in range(k):
# na[i] = ord(name[i]) - 65
# if na[i] > 13:
# na[i] = 26 - na[i]
# if na[i] == 0:
# q.append(i)
# answer += na[i]
# if len(q) == 1:
# if q[0] == 1 or q[0] == k - 1:
# answer += k - 2
# else:
# answer += k - 1
# else:
# for i in range(len(q)):
#
# return answer
#
#
# n = input()
# print(solution(n))
# def solution(number, k):
# answer = ''
# l = len(number)
# num = [0] * l
# for i in range(l):
# num[i] = int(number[i])
# a = [0] * (l - k)
# for i in range(l - k):
# a[l - k - i - 1] = num[-i-1]
# print(a)
# for i in range(l - k):
#
# return answer
#
#
# n = input()
# k = int(input())
# print(solution(n, k))
def solution(n, times):
answer = 0
k = len(times)
return answer
n = int(input())
time = list(map(int, input().split()))
print(solution(n, time))