很快，伯兰将举行一场战胜外星入侵者的游行。不幸的是，所有士兵都在战争中丧生，现在军队由全新的新兵组成，其中许多人甚至不知道他们应该从哪条腿开始行军。平民也不太了解新兵从哪条腿开始行军，因此有多少士兵步调一致才重要。
将有n个纵队参加阅兵，第i纵队由从左腿开始行军的黎族士兵和从右腿开始行军的里兵组成。
阅兵的美感由以下公式计算：如果L是阅兵中从左腿开始行进的士兵总数，R是阅兵队伍中从右腿开始行进的士兵总数，那么美感将等于|L-R|。
你可以选择一列，并告诉这个纵队中的所有士兵切换起始腿，即这个纵队中从左腿开始行军的每个人现在将从右腿开始行军，反之亦然。正式地，您可以选择不超过一个索引 i 并交换值 li 和 ri。
找到柱子的索引，这样切换其中士兵的起跑腿将最大限度地提高阅兵的美感，或者确定，没有这样的操作可以增加当前的美感。
Very soon there will be a parade of victory over alien invaders in Berland. Unfortunately, all soldiers died in the war and now the army consists of entirely new recruits, many of whom do not even know from which leg they should begin to march. The civilian population also poorly understands from which leg recruits begin to march, so it is only important how many soldiers march in step.
There will be n columns participating in the parade, the i-th column consists of li soldiers, who start to march from left leg, and ri soldiers, who start to march from right leg.
The beauty of the parade is calculated by the following formula: if L is the total number of soldiers on the parade who start to march from the left leg, and R is the total number of soldiers on the parade who start to march from the right leg, so the beauty will equal |L-R|.
No more than once you can choose one column and tell all the soldiers in this column to switch starting leg, i.e. everyone in this columns who starts the march from left leg will now start it from right leg, and vice versa. Formally, you can pick no more than one index i and swap values li and ri.
Find the index of the column, such that switching the starting leg for soldiers in it will maximize the the beauty of the parade, or determine, that no such operation can increase the current beauty.
Output
Print single integer
k− the number of the column in which soldiers need to change the leg from which they start to march, or
0 if the maximum beauty is already reached.
Consider that columns are numbered from 1 to
n in the order they are given in the input data.
If there are several answers, print any of them.
Note
In the first example if you don't give the order to change the leg, the number of soldiers, who start to march from the left leg, would equal
5+8+10=23, and from the right leg−
6+9+3=18. In this case the beauty of the parade will equal
|23-18|=5.
If you give the order to change the leg to the third column, so the number of soldiers, who march from the left leg, will equal
5+8+3=16, and who march from the right leg−
6+9+10=25. In this case the beauty equals
|16-25|=9.
It is impossible to reach greater beauty by giving another orders. Thus, the maximum beauty that can be achieved is 9.