write a go solution for Description:
Chaneka, Pak Chanek's child, is an ambitious kid, so Pak Chanek gives her the following problem to test her ambition.

Given an array of integers [A_1,A_2,A_3,ldots,A_N]. In one operation, Chaneka can choose one element, then increase or decrease the element's value by 1. Chaneka can do that operation multiple times, even for different elements.

What is the minimum number of operations that must be done to make it such that A_1xA_2xA_3xldotsxA_N=0?

Input Format:
The first line contains a single integer N (1<=qN<=q10^5).

The second line contains N integers A_1,A_2,A_3,ldots,A_N (-10^5<=qA_i<=q10^5).

Output Format:
An integer representing the minimum number of operations that must be done to make it such that A_1xA_2xA_3xldotsxA_N=0.

Note:
In the first example, initially, A_1xA_2xA_3=2x(-6)x5=-60. Chaneka can do the following sequence of operations:

1. Decrease the value of A_1 by 1. Then, A_1xA_2xA_3=1x(-6)x5=-30
2. Decrease the value of A_1 by 1. Then, A_1xA_2xA_3=0x(-6)x5=0

In the third example, Chaneka does not have to do any operations, because from the start, it already holds that A_1xA_2xA_3xA_4xA_5=0x(-1)x0x1x0=0. Output only the code with no comments, explanation, or additional text.