Deep in the honey farms of Buzzwell, Galen studies rows of crates entries. One clean number will settle the guild's oldest argument. Task: Read n integers and print the sum of their squares. Input format: First line: n. Second line: n space-separated integers. Output format: Print the sum of squares. Constraints: 1 <= n <= 95; -100 <= a[i] <= 1000000000; answers fit a signed 64-bit integer.
Example 1:
Example 2:
Example 3:
Constraints:
1 <= n <= 95; -100 <= a[i] <= 1000000000; answers fit a signed 64-bit integer.
