Problem: You are given an integer array of length n.

You have to choose some subsequence of this array of maximum length such that this subsequence forms a increasing sequence of consecutive integers. In other words the required sequence should be equal to [x, x + 1, ..., x + k - 1] for some value x and length k.

Subsequence of an array can be obtained by erasing some (possibly zero) elements from the array. You can erase any elements, not necessarily going successively. The remaining elements preserve their order. For example, for the array [5, 3, 1, 2, 4] the following arrays are subsequences: [3], [5, 3, 1, 2, 4], [5, 1, 4], but the array [1, 3] is not.

Input

The first line of the input containing integer number n (1 ≤ n ≤ 2 ⋅ 10^5) — the length of the array. The second line of the input containing n integer numbers a_1, a_2, ..., a_n (1 ≤ a_i ≤ 10^9) — the array itself.

Output

On the first line print k — the maximum length of the subsequence of the given array that forms an increasing sequence of consecutive integers.

On the second line print the sequence of the indices of the any maximum length subsequence of the given array that forms an increasing sequence of consecutive integers.

Examples

Input

7
3 3 4 7 5 6 8


Output

4
2 3 5 6 


Input

6
1 3 5 2 4 6


Output

2
1 4 


Input

4
10 9 8 7


Output

1
1 


Input

9
6 7 8 3 4 5 9 10 11


Output

6
1 2 3 7 8 9 

Note

All valid answers for the first example (as sequences of indices): 

  * [1, 3, 5, 6] 
  * [2, 3, 5, 6] 



All valid answers for the second example: 

  * [1, 4] 
  * [2, 5] 
  * [3, 6] 



All valid answers for the third example: 

  * [1] 
  * [2] 
  * [3] 
  * [4] 



All valid answers for the fourth example: 

  * [1, 2, 3, 7, 8, 9] 

Solution (in JAVA):

Solution:
					/*
					TO LEARN
					1-segment trees
					2-euler tour
				
					*/
					/*
					TO SOLVE 
					uva 1103
					codeforces 722 kavi on pairing duty
					*/
					/*
					bit manipulation shit
					1-Computer Systems: A Programmer's Perspective
					2-hacker's delight
					3-(02-03-bits-ints)
					4-machine-basics
					5-Bits Manipulation tutorialspoint
					*/
					/*
					TO WATCH
					1-what is bitmasking by kartik arora youtube
					*/
					            import java.util.*;
							    import java.math.*;
							    import java.io.*; 
							    import java.util.stream.Collectors;

							       public class A{
							     
							  static InputStream inputStream = System.in;
					            static FastScanner scan=new FastScanner();
							     public static PrintWriter out = new PrintWriter (new BufferedOutputStream(System.out));
static void remove(Map<Long,Long>map,long x)
{
	if(map.get(x)==1)
		map.remove(x);
	else map.put(x,map.get(x)-1);
}

						public static void main(String[] args)  throws Exception 
					      {
						
								///scan=new FastScanner("cownomics.in");
							//out = new PrintWriter("cownomics.out");
							 
							 /*
							 currently doing 
							 1-digit dp
							 2-ds like fenwick and interval tree and sparse table 
							 */
							 /*
							 READING 
							 1-Everything About Dynamic Programming codeforces
							 2-DYNAMIC PROGRAMMING: FROM NOVICE TO ADVANCED topcoder
							 3-Introduction to DP with Bitmasking codefoces
							 4-Bit Manipulation hackerearth
							 5-read more about mobious and inculsion-exclusion 
							 */
			


							    int tt=1;
							//tt=scan.nextInt();
							int T=tt;
						 outer:while(tt-->0)
							    {
							    	int n=scan.nextInt();
					Map<Integer,Integer>map=new HashMap<Integer,Integer>();
					Map<Integer,TreeSet<Integer>>map2=new HashMap<Integer,TreeSet<Integer>>();
					int dp[]=new int[n];
					int arr[]=new int[n];
					for(int i=0;i<n;i++)
						arr[i]=scan.nextInt();
					Arrays.fill(dp,1);
					for(int i=n-1;i>=0;i--)
					{
						if(map.containsKey(arr[i]+1))
						{
							dp[i]+=dp[map.get(arr[i]+1)];
						}
						map.put(arr[i],i);
					}
					//out.println(Arrays.toString(dp));
					for(int i=0;i<n;i++)
					{
						if(!map2.containsKey(arr[i]))
						{
							map2.put(arr[i],new TreeSet());
							map2.get(arr[i]).add(i);
						}
						else map2.get(arr[i]).add(i);
					}
					int idx=0,max=0;
					for(int i=0;i<n;i++)
						if(dp[i]>max)
						{
							max=dp[i];
							idx=i;
						}
						ArrayList<Integer>res=new ArrayList<Integer>();
						//System.out.println(Arrays.toString(dp));
						while(max>0)
						{
							res.add(idx);
							if(max-1>0){

int tmp=idx;
							idx=map2.get(arr[idx]+1).higher(idx);

						}
							max--;
						}

			//		out.println(Arrays.toString(dp));
out.println(res.size());
for(int i:res)
out.print((i+1)+" ");
out.println();
			
							 

	}
	out.close();
				}
	    
							static class special{
								boolean bool;
								long n;
								//int id;
								special(boolean bool,long n)
								{
									this.bool=bool;
									this.n=n;
								}
								@Override
								    public int hashCode() {
							                int hash = 7;
				    hash = 31 * hash + (int) n;
				   
				    return hash;
							            }
							              @Override
							            public boolean equals(Object o){
							                if (o == this) return true;
							                if (o.getClass() != getClass()) return false;
							                special t = (special)o;
							                return t.bool == bool && t.n == n;
							            }
							}

							   
							     static long binexp(long a,long n)
							    {
							        if(n==0)
							            return 1;
							        long res=binexp(a,n/2);
							        if(n%2==1)
							            return res*res*a;
							        else 
							            return res*res;
							    }
							     
							    static long powMod(long base, long exp, long mod) {
							           if (base == 0 || base == 1) return base;
							           if (exp == 0) return 1;
							           if (exp == 1) return (base % mod+mod)%mod;
							           long R = (powMod(base, exp/2, mod) % mod+mod)%mod;
							           R *= R;
							           R %= mod;
							           if ((exp & 1) == 1) {
							               return (base * R % mod+mod)%mod;
							           }
							           else return (R %mod+mod)%mod;
							       }
							    static double dis(double x1,double y1,double x2,double y2)
							    {
							        return Math.sqrt((x1-x2)*(x1-x2)+(y1-y2)*(y1-y2));
							    }
							    static long mod(long x,long y)
							        {
							            if(x<0)
							                x=x+(-x/y+1)*y;
							            return x%y;
							        }
							     public static  long pow(long b, long e) {
							                long r = 1;
							                while (e > 0) {
							                    if (e % 2 == 1) r = r * b ;
							                    b = b * b;
							                    e >>= 1;
							                }
							                return r;
							            }
							    private static void sort(long[] arr) {
							            List<Long> list = new ArrayList<>();
							            for (long object : arr) list.add(object);
							            Collections.sort(list);
							        //Collections.reverse(list);
							            for (int i = 0; i < list.size(); ++i) arr[i] = list.get(i);
							        }
							    private static void sort2(long[] arr) {
							            List<Long> list = new ArrayList<>();
							            for (Long object : arr) list.add(object);
							            Collections.sort(list);
							        Collections.reverse(list);
							            for (int i = 0; i < list.size(); ++i) arr[i] = list.get(i);
							        }
							     static class FastScanner
					{
					    private int BS = 1 << 16;
					    private char NC = (char) 0;
					    private byte[] buf = new byte[BS];
					    private int bId = 0, size = 0;
					    private char c = NC;
					    private double cnt = 1;
					    private BufferedInputStream in;
					 
					    public FastScanner() {
					        in = new BufferedInputStream(System.in, BS);
					    }
					 
					    public FastScanner(String s) {
					        try {
					            in = new BufferedInputStream(new FileInputStream(new File(s)), BS);
					        } catch (Exception e) {
					            in = new BufferedInputStream(System.in, BS);
					        }
					    }
					 
					    private char getChar() {
					        while (bId == size) {
					            try {
					                size = in.read(buf);
					            } catch (Exception e) {
					                return NC;
					            }
					            if (size == -1) return NC;
					            bId = 0;
					        }
					        return (char) buf[bId++];
					    }
					 
					    public int nextInt() {
					        return (int) nextLong();
					    }
					 
					    public int[] nextInts(int N) {
					        int[] res = new int[N];
					        for (int i = 0; i < N; i++) {
					            res[i] = (int) nextLong();
					        }
					        return res;
					    }
					 
					    public long[] nextLongs(int N) {
					        long[] res = new long[N];
					        for (int i = 0; i < N; i++) {
					            res[i] = nextLong();
					        }
					        return res;
					    }
					 
					    public long nextLong() {
					        cnt = 1;
					        boolean neg = false;
					        if (c == NC) c = getChar();
					        for (; (c < '0' || c > '9'); c = getChar()) {
					            if (c == '-') neg = true;
					        }
					        long res = 0;
					        for (; c >= '0' && c <= '9'; c = getChar()) {
					            res = (res << 3) + (res << 1) + c - '0';
					            cnt *= 10;
					        }
					        return neg ? -res : res;
					    }
					 
					    public double nextDouble() {
					        double cur = nextLong();
					        return c != '.' ? cur : cur + nextLong() / cnt;
					    }
					 
					    public double[] nextDoubles(int N) {
					        double[] res = new double[N];
					        for (int i = 0; i < N; i++) {
					            res[i] = nextDouble();
					        }
					        return res;
					    }
					 
					    public String next() {
					        StringBuilder res = new StringBuilder();
					        while (c <= 32) c = getChar();
					        while (c > 32) {
					            res.append(c);
					            c = getChar();
					        }
					        return res.toString();
					    }
					 
					    public String nextLine() {
					        StringBuilder res = new StringBuilder();
					        while (c <= 32) c = getChar();
					        while (c != '\n') {
					            res.append(c);
					            c = getChar();
					        }
					        return res.toString();
					    }
					 
					    public boolean hasNext() {
					        if (c > 32) return true;
					        while (true) {
					            c = getChar();
					            if (c == NC) return false;
					            else if (c > 32) return true;
					        }
					    }
					}

							     static class Pair implements Comparable<Pair>{
							            public long x, y,z;
							            public Pair(long x1, long y1,long z1) {
							                x=x1;
							                y=y1;
							                z=z1;
							            }
							             public Pair(long x1, long y1) {
							                x=x1;
							                y=y1;
							    
							            }
							            
							            @Override
							            public int hashCode() {
							                return (int)(x + 31 * y);
							            }
							            public String toString() {
							                return x + " " + y+" "+z;
							            }
							            @Override
							            public boolean equals(Object o){
							                if (o == this) return true;
							                if (o.getClass() != getClass()) return false;
							                Pair t = (Pair)o;
							                return t.x == x && t.y == y&&t.z==z;
							            }
							    public int compareTo(Pair o)
							    {
							    	
							    
							    	return (int)(o.y-y);
							     
							        }
							     
							    }
							    
							    }