n = int(input())
b = list(map(int, input().split()))
blocks = sum(b)
i = 1
while (i+1)**2 <= blocks:
    i += 1
p = i**2

pyramid = [x if x <=i else i-(idx-i) for idx, x in enumerate(range(1,i*2),1)]

if len(pyramid) < len(b):
    pyramid = pyramid + [0] * (len(b)-len(pyramid))
if len(b) < len(pyramid):
    b = b + [0] * (len(pyramid)-len(b))

pb = 0
mb = 0
for j, k in zip(pyramid, b):
    if k > j:
        mb += k - j
    elif j > k:
        pb += j - k

if blocks > p:
    print(mb)
else:
    print(pb)