Every season at the ivy courts of Vineward, someone must forecast next month's demand. This year the task falls to Porter, armed only with the barrels register. Task: Read n integers and print the sum of values at even 1-based positions minus the sum at odd positions. Input format: First line: n. Second line: n space-separated integers. Output format: Print (sum of even-positioned) - (sum of odd-positioned). Constraints: 1 <= n <= 95; -1000000 <= a[i] <= 1000; answers fit a signed 64-bit integer.
Example 1:
Example 2:
Example 3:
Constraints:
1 <= n <= 95; -1000000 <= a[i] <= 1000; answers fit a signed 64-bit integer.
