from collections import deque
N=int(input())
H=list(map(int,input().split()))
Q=deque()
Q.append(10**10)
ans=0
for i in range(N):
	now=0
	while True:
		h=Q.popleft()
		if now+h>H[i]:
			if len(Q)%2==0:
				if i%2==1: #緑
					Q.appendleft(h+now)
				else:
					Q.appendleft(h+now-H[i])
					Q.appendleft(H[i])
					ans+=H[i]
			else:
				if i%2==1:
					Q.appendleft(h+now-H[i])
					Q.appendleft(H[i])
					ans-=(H[i]-now)
				else:
					Q.appendleft(h+now)
					ans+=(now)
			break
		now+=h
		if len(Q)%2==1:
			ans-=h
	print(ans)#,Q)