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 java.util.*;
import java.io.*;
public class Fun {
    static class pair {
        int a;
        int b;

        pair(int x, int y) {
            a = x;
            b = y;
        }
    }
    static class Reader {
        final private int BUFFER_SIZE = 1 << 16;
        private DataInputStream din;
        private byte[] buffer;
        private int bufferPointer, bytesRead;

        public Reader()
        {
            din = new DataInputStream(System.in);
            buffer = new byte[BUFFER_SIZE];
            bufferPointer = bytesRead = 0;
        }

        public Reader(String file_name) throws IOException
        {
            din = new DataInputStream(
                    new FileInputStream(file_name));
            buffer = new byte[BUFFER_SIZE];
            bufferPointer = bytesRead = 0;
        }

        public String readLine() throws IOException
        {
            byte[] buf = new byte[64]; // line length
            int cnt = 0, c;
            while ((c = read()) != -1) {
                if (c == '\n') {
                    if (cnt != 0) {
                        break;
                    }
                    else {
                        continue;
                    }
                }
                buf[cnt++] = (byte)c;
            }
            return new String(buf, 0, cnt);
        }

        public int nextInt() throws IOException
        {
            int ret = 0;
            byte c = read();
            while (c <= ' ') {
                c = read();
            }
            boolean neg = (c == '-');
            if (neg)
                c = read();
            do {
                ret = ret * 10 + c - '0';
            } while ((c = read()) >= '0' && c <= '9');

            if (neg)
                return -ret;
            return ret;
        }

        public long nextLong() throws IOException
        {
            long ret = 0;
            byte c = read();
            while (c <= ' ')
                c = read();
            boolean neg = (c == '-');
            if (neg)
                c = read();
            do {
                ret = ret * 10 + c - '0';
            } while ((c = read()) >= '0' && c <= '9');
            if (neg)
                return -ret;
            return ret;
        }

        public double nextDouble() throws IOException
        {
            double ret = 0, div = 1;
            byte c = read();
            while (c <= ' ')
                c = read();
            boolean neg = (c == '-');
            if (neg)
                c = read();

            do {
                ret = ret * 10 + c - '0';
            } while ((c = read()) >= '0' && c <= '9');

            if (c == '.') {
                while ((c = read()) >= '0' && c <= '9') {
                    ret += (c - '0') / (div *= 10);
                }
            }

            if (neg)
                return -ret;
            return ret;
        }

        private void fillBuffer() throws IOException
        {
            bytesRead = din.read(buffer, bufferPointer = 0,
                    BUFFER_SIZE);
            if (bytesRead == -1)
                buffer[0] = -1;
        }

        private byte read() throws IOException
        {
            if (bufferPointer == bytesRead)
                fillBuffer();
            return buffer[bufferPointer++];
        }

        public void close() throws IOException
        {
            if (din == null)
                return;
            din.close();
        }
    }

    public static void main(String[] args)
            throws IOException
    {
        Reader obj = new Reader();
        int n = obj.nextInt();
        int[] num = new int[n];
        HashMap<Integer, Vector<Integer>> map = new HashMap<>();
        Vector<Integer> imp = new Vector<>();
        int c2 = 0, c4 = 0, i4 = -1, i21 = -1, i22 = -1;
        for (int i = 0; i < n; i++) {
            num[i] = obj.nextInt();
            imp.add(num[i]);
            Vector<Integer> t = map.get(num[i]);
            if (t == null) {
                Vector<Integer> tt = new Vector<>();
                tt.add(i + 1);
                map.put(num[i], tt);
            } else {
                t.add(i + 1);
                map.put(num[i], t);
                if (t.size() == 2) {
                    if (i21 == -1) i21 = num[i];
                    else if (i22 == -1) i22 = num[i];
                    c2++;
                } else if (t.size() == 4) {
                    i4 = num[i];
                    c4++;
                }
            }
        }
        if (c4 >= 1) {
            Vector<Integer> vv = map.get(i4);
            System.out.println("YES");
            for (int i = 0; i < 4; i++) System.out.print(vv.get(i) + " ");
        }
        else if (c2 >= 2) {
            Vector<Integer> v1 = map.get(i21);
            Vector<Integer> v2 = map.get(i22);
            System.out.println("YES");
            System.out.println(v1.get(0) + " " + v2.get(0) + " " + v1.get(1) + " " + v2.get(1));
        } else {
            if (solve(imp) == false) System.out.println("NO");
        }

    }

    public static boolean solve(Vector<Integer> imp) {
        HashMap<Integer, Vector<pair>> map = new HashMap<>();
        for (int i = 0; i < imp.size(); i++) {
            for (int j = i + 1; j < imp.size(); j++) {
                int sum = imp.get(i) + imp.get(j);
                int a = i + 1, b = j + 1;
                Vector<pair> v = map.get(sum);
                if (v == null) {
                    Vector<pair> vv = new Vector<>();
                    vv.add(new pair(i + 1, j + 1));
                    map.put(sum, vv);
                } else {
                    for (int k = 0; k < v.size(); k++) {
                        pair t = v.get(k);
                        if (t.a != a && t.b != b && t.a != b && t.b != a) {
                            System.out.println("YES");
                            System.out.println(t.a + " " + t.b+" "+a+" "+b);
                            return true;
                        }
                    }
                    v.add(new pair(a, b));
                    map.put(sum, v);
                }
            }
        }
        return false;
    }
}