Problem: It was the third month of remote learning, Nastya got sick of staying at dormitory, so she decided to return to her hometown. In order to make her trip more entertaining, one of Nastya's friend presented her an integer array a. 

Several hours after starting her journey home Nastya remembered about the present. To entertain herself she decided to check, are there four different indices x, y, z, w such that a_x + a_y = a_z + a_w.

Her train has already arrived the destination, but she still hasn't found the answer. Can you help her unravel the mystery?

Input

The first line contains the single integer n (4 ≤ n ≤ 200 000) — the size of the array.

The second line contains n integers a_1, a_2, …, a_n (1 ≤ a_i ≤ 2.5 ⋅ 10^6).

Output

Print "YES" if there are such four indices, and "NO" otherwise.

If such indices exist, print these indices x, y, z and w (1 ≤ x, y, z, w ≤ n).

If there are multiple answers, print any of them.

Examples

Input


6
2 1 5 2 7 4


Output


YES
2 3 1 6 

Input


5
1 3 1 9 20


Output


NO

Note

In the first example a_2 + a_3 = 1 + 5 = 2 + 4 = a_1 + a_6. Note that there are other answer, for example, 2 3 4 6.

In the second example, we can't choose four indices. The answer 1 2 2 3 is wrong, because indices should be different, despite that a_1 + a_2 = 1 + 3 = 3 + 1 = a_2 + a_3

Solution (in JAVA):

Solution:

import static java.lang.Integer.parseInt;
import static java.lang.Long.parseLong;
import static java.lang.Double.parseDouble;
import static java.lang.Math.PI;
import static java.lang.Math.min;
import static java.lang.System.arraycopy;
import static java.lang.System.exit;
import static java.util.Arrays.copyOf;

import java.util.LinkedList;
import java.io.FileReader;
import java.io.FileWriter;
import java.math.BigInteger; 
import java.util.ArrayList;
import java.util.Arrays;
import java.util.HashSet;
import java.util.Set;
import java.io.BufferedReader;
import java.io.IOException;
import java.io.InputStreamReader;
import java.io.PrintWriter;
import java.util.HashMap;
import java.util.NoSuchElementException;
import java.util.PriorityQueue;
import java.util.StringTokenizer;
import java.util.Comparator;
import java.lang.StringBuilder;
import java.util.Collections;
public class Solution {

	static int scanInt() throws IOException {
		return parseInt(scanString());
	}

	static long scanLong() throws IOException {
		return parseLong(scanString());
	}
	static double scanDouble() throws IOException {
		return parseDouble(scanString());
	}

	static String scanString() throws IOException {
		if (tok == null || !tok.hasMoreTokens()) {
			tok = new StringTokenizer(in.readLine());
		}
		return tok.nextToken();
	}
	static String scanLine() throws IOException {
		return in.readLine();
	}

	static void printCase(String str) {
		out.print("Case #" + test + ": "+str);
	}

	static void printlnCase() {
		out.println("Case #" + test + ":");
	}

	static BufferedReader in;
	static PrintWriter out;
	static StringTokenizer tok;
	static int test;
	static StringBuilder str;
	public static void main(String[] args) {
		try {
			long startTime = System.currentTimeMillis();

			in = new BufferedReader(new InputStreamReader(System.in));
			out = new PrintWriter(System.out);
			//in = new BufferedReader(new FileReader("input.txt"));
			//out = new PrintWriter(new FileWriter("output.txt"));
			/*int tests = scanInt(); 
			for (test = 1; test <= tests; test++) {	
				int n=scanInt();
				
			}*/
			
			/*String []bank={"ab","abc","cd","def","abcd"};
			out.println(countConstruct("abcdef",bank));
			String bank2[]={"bo","rd","ate","t","ska","sk","boar"};
			out.println(countConstruct("skateboard",bank2));
			String bank3[]={"a","p","ent","enter","ot","o","t"};
			out.println(countConstruct("enterapotentpot",bank3));
			String bank4[]={"e","ee","eee","eeee","eeeee","eeeeee"};
			out.println("ans"+countConstruct("eeeeeeeeeeeeeeeeeeeeeeeef",bank4));
			String bank5[]={"purp","p","ur","le","purpl","purple"};
			allConstruct("purple",bank5);
			for(ArrayList<String> data: xyz)
				out.println(data);*/
			
			solve();
			
			long endTime   = System.currentTimeMillis();
			long totalTime = endTime - startTime;
			//System.out.println(totalTime+"  "+System.currentTimeMillis() );
			in.close();
			out.close();
			
		} catch (Throwable e) {
			e.printStackTrace();
			exit(1);
		}
	}
	private static void solve() throws IOException{
		int mxSum=(int)5E6+1;
		int arr[]=new int[200001];
		int n=scanInt();
		for(int i=1; i<=n;++i)
			arr[i]=scanInt();
		int[][] sum=new int[mxSum][2];
		for(int i=1; i<=n; ++i){
			for(int j=i+1; j<=n; ++j){
				int temp=arr[i]+arr[j];
				int x=sum[temp][0],y=sum[temp][1];
				if(x!=0 && y!=0){
					if(x!=i && x!=j && y!=i && y!=j){
						out.println("YES\n"+(x)+" "+(y)+" "+(i)+" "+(j));
						return;
					} 
				}
					sum[temp][0]=i;
					sum[temp][1]=j;
			}
		}
		
		out.println("NO");
		
		
		
	}
	
	
	
	static class Index{
		int i,j;
		public Index(int i, int j){
			this.i=i;
			this.j=j;
			
		}
	}
	/*
	
	private static void allConstruct(String str, String bank[]){
		ArrayList<ArrayList<String>> dp[]= new ArrayList[str.length()+1];
		//HashMap<Integer,ArrayList<String>> dp[]=new HashMap[str.length()+1];
		dp[0]=new ArrayList<>();
		
		dp[0].add(new ArrayList<>());
		
		for(int i=0; i<=str.length(); ++i){
			String temp=str.substring(i);
			//out.println(dp[i]);
			if(dp[i]!=null){
				for(int j=0; j<bank.length; ++j){
					if(temp.startsWith(bank[j])){	
						for(ArrayList<String> data: dp[i]){
							ArrayList<String> x=new ArrayList<>(data);
							x.add(bank[j]);
							if(dp[i+bank[j].length()]==null)
								dp[i+bank[j].length()]=new ArrayList<>();
							dp[i+bank[j].length()].add(x);	
						}	
					}
				}
			}
		}
		for(int i=0; i<=str.length(); ++i){
			out.println(dp[i]);
		}
		//return dp;
	}
	private static int countConstruct(String str, String []bank){
		int dp[]=new int[str.length()+1];
		dp[0]=1;
		for(int i=0; i<=str.length(); ++i){
			String temp=str.substring(i);
			if(dp[i]!=0){
				for(int j=0; j<bank.length; ++j){
					if(temp.startsWith(bank[j])){
						dp[i+bank[j].length()]+=dp[i];
					}
				}
				for(Integer data: dp){
						out.print(data+" ");
					}
					out.println();
			}
		}
		return(dp[str.length()]);
		
	}
	private static boolean canConstruct(String str, String []bank){
		boolean dp[]=new boolean[str.length()+1];
			dp[0]=true;
			for(int i=0;i<=str.length();++i){
				String temp=str.substring(i);
				if(dp[i]){
					for(int j=0; j<bank.length; ++j){
						if(temp.startsWith(bank[j])){
							dp[i+bank[j].length()]=true;
						}
					}
					/*for(Boolean data: dp){
						out.print(data+" ");
					}
					out.println();
				}
				
			}
			
		return dp[str.length()];
	}

	*/
 }