The package for this problem was not updated by the problem writer or Codeforces administration after we've upgraded the judging servers. To adjust the time limit constraint, a solution execution time will be multiplied by 2. For example, if your solution works for 400 ms on judging servers, then the value 800 ms will be displayed and used to determine the verdict.

Virtual contest is a way to take part in past contest, as close as possible to participation on time. It is supported only ICPC mode for virtual contests.
If you've seen these problems, a virtual contest is not for you - solve these problems in the archive.
If you just want to solve some problem from a contest, a virtual contest is not for you - solve this problem in the archive.
Never use someone else's code, read the tutorials or communicate with other person during a virtual contest.

No tag edit access

The problem statement has recently been changed. View the changes.

×
C. Weather

time limit per test

1 secondmemory limit per test

256 megabytesinput

input.txtoutput

output.txtScientists say a lot about the problems of global warming and cooling of the Earth. Indeed, such natural phenomena strongly influence all life on our planet.

Our hero Vasya is quite concerned about the problems. He decided to try a little experiment and observe how outside daily temperature changes. He hung out a thermometer on the balcony every morning and recorded the temperature. He had been measuring the temperature for the last *n* days. Thus, he got a sequence of numbers *t*_{1}, *t*_{2}, ..., *t*_{n}, where the *i*-th number is the temperature on the *i*-th day.

Vasya analyzed the temperature statistics in other cities, and came to the conclusion that the city has no environmental problems, if first the temperature outside is negative for some non-zero number of days, and then the temperature is positive for some non-zero number of days. More formally, there must be a positive integer *k* (1 ≤ *k* ≤ *n* - 1) such that *t*_{1} < 0, *t*_{2} < 0, ..., *t*_{k} < 0 and *t*_{k + 1} > 0, *t*_{k + 2} > 0, ..., *t*_{n} > 0. In particular, the temperature should never be zero. If this condition is not met, Vasya decides that his city has environmental problems, and gets upset.

You do not want to upset Vasya. Therefore, you want to select multiple values of temperature and modify them to satisfy Vasya's condition. You need to know what the least number of temperature values needs to be changed for that.

Input

The first line contains a single integer *n* (2 ≤ *n* ≤ 10^{5}) — the number of days for which Vasya has been measuring the temperature.

The second line contains a sequence of *n* integers *t*_{1}, *t*_{2}, ..., *t*_{n} (|*t*_{i}| ≤ 10^{9}) — the sequence of temperature values. Numbers *t*_{i} are separated by single spaces.

Output

Print a single integer — the answer to the given task.

Examples

Input

4

-1 1 -2 1

Output

1

Input

5

0 -1 1 2 -5

Output

2

Note

Note to the first sample: there are two ways to change exactly one number so that the sequence met Vasya's condition. You can either replace the first number 1 by any negative number or replace the number -2 by any positive number.

Codeforces (c) Copyright 2010-2022 Mike Mirzayanov

The only programming contests Web 2.0 platform

Server time: May/23/2022 17:33:54 (g1).

Desktop version, switch to mobile version.

Supported by

User lists

Name |
---|