package LanQiaoOJ;

import java.util.HashMap;
import java.util.Scanner;

public class 查找两个总和为特定值的索引2 {
	static int N=110;
	static int [] a=new int[N];
	public static void main(String[] args) {
		Scanner sc=new Scanner(System.in);
		int n=sc.nextInt();
		
		//key-value结构
		HashMap<Integer,Integer>map=new HashMap<>();
		for(int i=0;i<n;i++) {
			a[i]=sc.nextInt();
			map.put(a[i],i);
		}
		int target=sc.nextInt();
		for(int i=0;i<n;i++) {
			int A=a[i];
			if(map.containsKey(target-A)) {
				System.out.println(i+" "+map.get(target-A));
				return;
			}
		}
	}

}