Min Element

Given the sequence a_1, a_2, .., a_N.

Find the minimum number in this sequence.

If the minimum value is in more than one place, answer the one with the lowest number.

input


N
a_1 a_2 ... a_N


output

Output the smallest i such that a_i is the minimum value in the sequence.

Constraint

* 1 \ leq N \ leq 10 ^ 5
* 1 \ leq a_i \ leq 10 ^ 9



Input example


6
8 6 9 1 2 1


Output example


Four






Example

Input

6
8 6 9 1 2 1


Output

4
#include <iostream>
#include <vector>
#include <algorithm>
using namespace std;
#pragma warning (disable: 4996)

int N, A[1 << 18];
int minx = (1 << 30), minid = 0;

int main() {
	scanf("%d", &N);
	for (int i = 1; i <= N; i++) {
		scanf("%d", &A[i]);
		if (minx > A[i]) { minx = A[i]; minid = i; }
	}
	cout << minid << endl;
	return 0;
}
