import java.util.*;
import java.lang.*;
import java.io.*;

class Ideone
{
	public static void main (String[] args) throws java.lang.Exception
	{
		Scanner sc = new Scanner(System.in);
		int n = sc.nextInt();
		int[] arr = new int[n];

		for(int i =0;i<n;i++){
			arr[i] = sc.nextInt();
		}
		int[] prefixSum = new int[n];
		prefixSum[0] = arr[0];

		for(int i=1;i<n;i++){
		prefixSum[i] = prefixSum[i-1] + arr[i];
		}
		
		int k = sc.nextInt();
		HashMap<Integer,Integer> firstOccurrence = new HashMap<>();
		HashMap<Integer,Integer> lastOccurrence = new HashMap<>();
		int minLen = Integer.MAX_VALUE, maxLen = Integer.MIN_VALUE;

		firstOccurrence.put(0,-1);
		lastOccurrence.put(0,-1);
		
		for(int j =0;j<n;j++){
		int rem = prefixSum[j] - k;
		if(firstOccurrence.containsKey(rem)){
		maxLen = Math.max(maxLen,j-firstOccurrence.get(rem));
		}
		if(lastOccurrence.containsKey(rem)){
		minLen = Math.min(minLen,j-lastOccurrence.get(rem));
		}
		
		lastOccurrence.put(prefixSum[j],j);
		if(!firstOccurrence.containsKey(prefixSum[j])){
			firstOccurrence.put(prefixSum[j],j);
		}
		}
		System.out.println(minLen + " " + maxLen);
}
}