import sys
import math
import collections
import bisect
import itertools
import decimal
import heapq


# sys.setrecursionlimit(10**6+1)
INF = 1 << 62
MOD = 10 ** 9 + 7
# MOD = 998244353


def ni(): return int(sys.stdin.buffer.readline())
def ns(): return map(int, sys.stdin.buffer.readline().split())
def na(): return list(map(int, sys.stdin.buffer.readline().split()))
def na1(): return list(map(lambda x: int(x)-1, sys.stdin.buffer.readline().split()))
def nall(): return list(map(int, sys.stdin.buffer.read().split()))
def flush(): return sys.stdout.flush()


def nic(): return int(sys.stdin.readline())
def nsc(): return map(int, sys.stdin.readline().split())
def nac(): return list(map(int, sys.stdin.readline().split()))
def na1c(): return list(map(lambda x: int(x)-1, sys.stdin.readline().split()))


# ===CODE==
def main():
    n = ni()
    a = na()

    total = sum(a)
    ans = 0
    for i in range(0, 101):
        if (total+i) % n == 0:
            ans += 1
    print(ans)


if __name__ == '__main__':
    main()