codeforces 670C Cinema

C. Cinema

time limit per test

2 seconds

memory limit per test

256 megabytes

input

standard input

output

standard output

Moscow is hosting a major international conference, which is attended by n scientists from different countries. Each of the scientists knows exactly one language. For convenience, we enumerate all languages of the world with integers from 1 to 10⁹.

In the evening after the conference, all n scientists decided to go to the cinema. There are m movies in the cinema they came to. Each of the movies is characterized by two distinct numbers — the index of audio language and the index of subtitles language. The scientist, who came to the movie, will be very pleased if he knows the audio language of the movie, will be almost satisfied if he knows the language of subtitles and will be not satisfied if he does not know neither one nor the other (note that the audio language and the subtitles language for each movie are always different).

Scientists decided to go together to the same movie. You have to help them choose the movie, such that the number of very pleased scientists is maximum possible. If there are several such movies, select among them one that will maximize the number of almost satisfied scientists.

Input

The first line of the input contains a positive integer n (1 ≤ n ≤ 200 000) — the number of scientists.

The second line contains n positive integers a₁, a₂, ..., a_n (1 ≤ a_i ≤ 10⁹), where a_i is the index of a language, which the i-th scientist knows.

The third line contains a positive integer m (1 ≤ m ≤ 200 000) — the number of movies in the cinema.

The fourth line contains m positive integers b₁, b₂, ..., b_m (1 ≤ b_j ≤ 10⁹), where b_j is the index of the audio language of the j-th movie.

The fifth line contains m positive integers c₁, c₂, ..., c_m (1 ≤ c_j ≤ 10⁹), where c_j is the index of subtitles language of the j-th movie.

It is guaranteed that audio languages and subtitles language are different for each movie, that is b_j ≠ c_j.

Output

Print the single integer — the index of a movie to which scientists should go. After viewing this movie the number of very pleased scientists should be maximum possible. If in the cinema there are several such movies, you need to choose among them one, after viewing which there will be the maximum possible number of almost satisfied scientists.

If there are several possible answers print any of them.

Examples

Input

3
2 3 2
2
3 2
2 3

Output

2

Input

6
6 3 1 1 3 7
5
1 2 3 4 5
2 3 4 5 1

Output

1

Note

In the first sample, scientists must go to the movie with the index 2, as in such case the 1-th and the 3-rd scientists will be very pleased and the 2-nd scientist will be almost satisfied.

In the second test case scientists can go either to the movie with the index 1 or the index 3. After viewing any of these movies exactly two scientists will be very pleased and all the others will be not satisfied.

题意：C：N个科学家要去看电影，每个科学家只懂得一种语言。电影有两个语言：原声和字幕。选择一个片子使得能听懂原声的科学家数最大化，如果有多种可能，选取字幕最大化的那一个片子。输出片子的序号

思路：直接sort按原声数最大，字幕数第二排序即可

#include <iostream>
#include <cstdio>
#include <cstring>
#include <string>
#include <algorithm>
#include <cmath>
#include <cstdlib>
#include <stack>
#include <queue>
#include <set>
#include <map>
using namespace std;
const int inf = 2147483647;
const double PI = acos(-1.0);
const double e = 2.718281828459;
const int mod = 1000000007;
typedef long long LL;
#pragma comment(linker, "/STACK:102400000,102400000")
//freopen("in.txt","r",stdin); //输入重定向,输入数据将从in.txt文件中读取
//freopen("out.txt","w",stdout); //输出重定向,输出数据将保存在out.txt文件中cin
int a[200005];
map<LL, int>mp;
struct node
{
	int b, c, id;
}x[200005];
bool cmp(node x, node y)
{
	if (mp[x.b] == mp[y.b])
		return mp[x.c] > mp[y.c];
	return mp[x.b] > mp[y.b];
}
int main()
{
	int n, m, i, j;
	while (cin >> n)
	{
		mp.clear();
		int mmax = 0;
		for (i = 1; i <= n; ++i)
		{
			scanf("%d", &a[i]);
			mp[a[i]] ++;
			mmax = max(mmax, mp[a[i]]);
		}
		scanf("%d", &m);
		for (i = 1; i <= m; ++i)
		{
			scanf("%d", &x[i].b);
			x[i].id = i;
		}
		for (i = 1; i <= m; ++i)
			scanf("%d", &x[i].c);
		sort(x + 1, x + 1 + m, cmp);
		printf("%d\n", x[1].id);
	}
}