Codeforces Round #450 (Div. 2)ABC

A. Find Extra One

You have n distinct points on a plane, none of them lie on OY axis. Check that there is a point after removal of which the remaining points are located on one side of the OY axis.

Input

The first line contains a single positive integer n (2 ≤ n ≤ 10⁵).

The following n lines contain coordinates of the points. The i-th of these lines contains two single integers x_i and y_i (|x_i|, |y_i| ≤ 10⁹, x_i ≠ 0). No two points coincide.

Output

Print "Yes" if there is such a point, "No" — otherwise.

You can print every letter in any case (upper or lower).

Examples

Input

3
1 1
-1 -1
2 -1

Output

Yes

Input

4
1 1
2 2
-1 1
-2 2

Output

No

Input

3
1 2
2 1
4 60

Output

Yes

Note

In the first example the second point can be removed.

In the second example there is no suitable for the condition point.

In the third example any point can be removed.

是否存在删除一个点后所以的点都在x=0的一侧，只要判断在两侧是否有小于2个的点就行。

#include <bits/stdc++.h>
using namespace std;

int main() {
    int n;
    int ans = 0, ans1 = 0;
    cin >> n;
    for(int i = 0; i < n; i ++) {
        int x, y;
        cin >> x >> y;
        if(x < 0) ans++;
        else ans1++;
    }
    if(ans <= 1 || ans1 <= 1) printf("Yes\n");
    else printf("No\n");
    return 0;
}

B. Position in Fraction

You have a fraction . You need to find the first occurrence of digit c into decimal notation of the fraction after decimal point.

Input

The first contains three single positive integers a, b, c (1 ≤ a < b ≤ 10⁵, 0 ≤ c ≤ 9).

Output

Print position of the first occurrence of digit c into the fraction. Positions are numbered from 1 after decimal point. It there is no such position, print -1.

Examples

Input

1 2 0

Output

2

Input

2 3 7

Output

-1

Note

The fraction in the first example has the following decimal notation: . The first zero stands on second position.

The fraction in the second example has the following decimal notation: . There is no digit 7 in decimal notation of the fraction.

 判断c是在a/b的十进制中的小数第几位，没有就输出-1. 主要是模拟除法。

 

#include <bits/stdc++.h>
using namespace std;
int main() {
    int a, b, c, cnt = 0;
    cin >> a >> b >> c;
    a %= b;
    for(int i = 0; i < 1000; i ++) {
        if(a*10 < b && c == 0) return 0*printf("%d\n",cnt+1);
        while(a < b) {
            a*= 10,cnt++;
        }
        
        int tmp = a/b;
        if(tmp == c) return 0*printf("%d\n",cnt);
        a -= tmp*b;
        if(a == 0) {
            if(c == 0) return 0*printf("%d\n",cnt+1);
            break;
        }
    }
    printf("-1\n");
    return 0;
}

C. Remove Extra One

You are given a permutation p of length n. Remove one element from permutation to make the number of records the maximum possible.

We remind that in a sequence of numbers a₁, a₂, ..., a_k the element a_i is a record if for every integer j (1 ≤ j < i) the following holds: a_j < a_i.

Input

The first line contains the only integer n (1 ≤ n ≤ 10⁵) — the length of the permutation.

The second line contains n integers p₁, p₂, ..., p_n (1 ≤ p_i ≤ n) — the permutation. All the integers are distinct.

Output

Print the only integer — the element that should be removed to make the number of records the maximum possible. If there are multiple such elements, print the smallest one.

Examples

Input

1
1

Output

1

Input

5
5 1 2 3 4

Output

5

Note

In the first example the only element can be removed.

 求删掉哪个数可以使的record数量最大，换句话来说就是删除哪个数可以增加的record最多。

在当前元素a[i]时有三种情况。max1为a[i]前面的最大值，max2为a[i]前面的次大值。

一、max2 < max1 < a[i] 删除a[i]的话会使得record减一

二、max2 < a[i] < max1 输出a[i]既不会增加也不会减少，但删除max1会使得a[i]变成record。

三、a[i] < max1 < max2 删除哪一个都不会有影响。

#include <bits/stdc++.h>
using namespace std;
const int N = 1e5+10;
int a[N], cnt[N];
vector<int> vs;
int main() {
    int n;
    int max1 = 0, max2 = 0;
    cin >> n;
    for(int i = 1; i <= n; i++) {
        cin >> a[i];
        if(max1 < a[i]) {
            max2 = max1;
            max1 = a[i];
            cnt[a[i]]--;
        } else if(max2 < a[i]) {
            cnt[max1]++;
            max2 = a[i];
        }
    }
    int MAX = -1000000, ans = 0;
    for(int i = 1; i <= n; i ++) {
        if(cnt[i] > MAX) {
            ans = i;
            MAX = cnt[i];
        }
    }
    printf("%d\n",ans);
    return 0;
}