View Russian Translation

The great Kian is looking for a smart prime minister. He's looking for a guy who can solve the OLP (Old Legendary Problem). OLP is an old problem (obviously) that no one was able to solve it yet (like P=NP).

But still, you want to be the prime minister really bad. So here's the problem:

Given the sequence a₁, a₂, ..., a_n find the three values a₁ + a₄ + a₇ + ..., a₂ + a₅ + a₈ + ... and a₃ + a₆ + a₉ + ... (these summations go on while the indexes are valid).

Input

The first line of input contains a single integer n (1 ≤ n ≤ 10⁵).

The second line contains n integers a₁, a₂, ..., a_n separated by space (1 ≤ a_i ≤ 10⁹).

Output

Print three values in one line (the answers).