CF1130A.Be Positive

传统题 时间 2000 ms 内存 256 MiB 3 尝试 1 已通过 1 标签

Be Positive

You are given an array of nn integers: a1,a2,,ana_1, a_2, \ldots, a_n. Your task is to find some non-zero integer dd (103d103-10^3 \leq d \leq 10^3) such that, after each number in the array is divided by dd, the number of positive numbers that are presented in the array is greater than or equal to half of the array size (i.e., at least n2\lceil\frac{n}{2}\rceil). Note that those positive numbers do not need to be an integer (e.g., a 2.52.5 counts as a positive number). If there are multiple values of dd that satisfy the condition, you may print any of them. In case that there is no such dd, print a single integer 00.

Recall that x\lceil x \rceil represents the smallest integer that is not less than xx and that zero (00) is neither positive nor negative.

Input

The first line contains one integer nn (1n1001 \le n \le 100) — the number of elements in the array.

The second line contains nn space-separated integers a1,a2,,ana_1, a_2, \ldots, a_n (103ai103-10^3 \le a_i \le 10^3).

Output

Print one integer dd (103d103-10^3 \leq d \leq 10^3 and d0d \neq 0) that satisfies the given condition. If there are multiple values of dd that satisfy the condition, you may print any of them. In case that there is no such dd, print a single integer 00.

Note

In the first sample, n=5n = 5, so we need at least 52=3\lceil\frac{5}{2}\rceil = 3 positive numbers after division. If d=4d = 4, the array after division is [2.5,0,1.75,0.5,1.5][2.5, 0, -1.75, 0.5, 1.5], in which there are 33 positive numbers (namely: 2.52.5, 0.50.5, and 1.51.5).

In the second sample, there is no valid dd, so 00 should be printed.

Samples

5
10 0 -7 2 6
4
7
0 0 1 -1 0 0 2
0

在线编程 IDE

建议全屏模式获得最佳体验