There are quite a lot of ways to have fun with inflatable balloons. For example, you can fill them with water and see what happens.

Grigory and Andrew have the same opinion. So, once upon a time, they went to the shop and bought n packets with inflatable balloons, where i-th of them has exactly a_i balloons inside.

They want to divide the balloons among themselves. In addition, there are several conditions to hold:

  * Do not rip the packets (both Grigory and Andrew should get unbroken packets); 
  * Distribute all packets (every packet should be given to someone); 
  * Give both Grigory and Andrew at least one packet; 
  * To provide more fun, the total number of balloons in Grigory's packets should not be equal to the total number of balloons in Andrew's packets. 



Help them to divide the balloons or determine that it's impossible under these conditions.

Input

The first line of input contains a single integer n (1 ≤ n ≤ 10) — the number of packets with balloons.

The second line contains n integers: a_1, a_2, …, a_n (1 ≤ a_i ≤ 1000) — the number of balloons inside the corresponding packet.

Output

If it's impossible to divide the balloons satisfying the conditions above, print -1.

Otherwise, print an integer k — the number of packets to give to Grigory followed by k distinct integers from 1 to n — the indices of those. The order of packets doesn't matter.

If there are multiple ways to divide balloons, output any of them.

Examples

Input

3
1 2 1


Output

2
1 2


Input

2
5 5


Output

-1


Input

1
10


Output

-1

Note

In the first test Grigory gets 3 balloons in total while Andrey gets 1.

In the second test there's only one way to divide the packets which leads to equal numbers of balloons.

In the third test one of the boys won't get a packet at all.
import java.io.IOException;
import java.awt.color.*;
import java.util.*;
import java.awt.Point;
import java.math.*;
import java.io.*;
import java.util.InputMismatchException;
@SuppressWarnings("unused")
public class main {	String g="";int c=0;int M=1000000000+7;ArrayList<Integer> list=new ArrayList<Integer>();int[] a;String s;
int[]b;int[] data;int mod=100000;LinkedList<Integer> queue=new LinkedList<Integer>();int dis=0;int max=0;ArrayList<Integer>[] arr;
	public static void main(String[] args) {
                new main().solve();
                                  }
	long[] fact;long[] inv;
            public void solve() {
            	
            	int n=sc.nextInt();
            	a=new int[n];long sum=0;int min=Integer.MAX_VALUE;
            	for(int i=0;i<n;i++) {
            		a[i]=sc.nextInt();
            		if(a[i]<min) {
            		min=a[i];
            		c=i;}
            		}
            	
            	if(n==2&&a[0]==a[1]) {
            		
            			System.out.println(-1);
            	}
            	else if(n==1)
            		System.out.println(-1);
            	else {
            	System.out.println(1);
            	System.out.println(c+1);}
            	
            	
            	
            	
            	
       }
            private static int pow(int x, int n) {
                if (n == 0) return 1;
                if (n % 2 == 0) return pow(mul(x, x), n / 2);
                return mul(x, pow(mul(x, x), n / 2));
            } 
            private static int mul(int a, int b) {int M=1000000000+7;
                return (int) (((a % M) * 1L * (b % M)) % M);
            }
            
             
            // Returns n^(-1) mod p
          
            void fact0()
            {fact=new long[1000003];inv =new long[1000003];
            	int i,j;
            	fact[0]=1;
            	for(i=1;i<=200000;i++)
            	{
            		fact[i]=i*fact[i-1]%M;
            	}
            	inv[0]=1;
            	inv[1]=1;
            	long p=M;
            	for (i=2; i<=200000; i++)
            		inv[i] = (p - (p/i) * inv[(int)(p%i)] % p) % p;
            	
            	for(i=2;i<=200000;i++)
            	{
            		inv[i]*=inv[i-1];
            		inv[i]%=M;
            	}
            }
            
            long modularExponentiation(int x,long n,int M)
        	{
        	    long result=1;
        	    while(n>0)
        	    {
        	        if(n % 2 ==1)
        	            result=(result * x)%M;
        	        x=(x*x)%M;
        	        n=n/2;
        	    }
        	    return result;
        	}
                       
       void dfs(int s,int level) {
    	   b[s]=1;
    	   level++;
    	   Iterator<Integer> it=arr[s].iterator();
    	   while(it.hasNext()) {int cc=it.next();
    		   if(b[cc]==0) {
    			   data[level]++;
    			   dfs(cc,level);}
    	   }
       }
       
            
            void possibleway(int[] u,int n,int c,int g) {
            	if(c>=2*n+1)
            		return ;
            	boolean bata=false;
            	for(int i=0;i<2*n;i+=2) {
            		if(u[i]==u[i+1]) {
            			continue;
            		}
            		bata=true;
            	}
            	if(!bata) {
            		list.add(c);return ;
            	}
            	for(int i=0;i<2*n-1;i++) {
            		
            		if(i!=g) {
            		      int f=u[i];
            		      u[i]=u[i+1];
            		      u[i+1]=f;
            		possibleway(u, n, c+1,g);}
            	}
            }
            	void bfs(ArrayList[] arr,int y) {
            		
            		
            	
            	
            		while(queue.size()!=0) {
            			int curr=queue.removeFirst();
            			Iterator<Integer> it=arr[curr].iterator();
            			while(it.hasNext()) {
            				int c=it.next();
            				if(b[c]==0) {
            					b[c]=1;
            					a[c]=curr;
            				queue.add(c);
            				if(c==y)
            					break;
            				}
            			}if(c==y)
            				break;
            		}
            	
            	
            	}
            
            
            
            
            
            
            
            
                      public class multipliers implements Comparator<Node>{
            	
            	public int compare(Node a,Node b) {
            		if(a.color<b.color)
            			return 1;
            		else if(b.color<a.color)
            			return -1;
            		else {
            			if(a.data<b.data)
            				return -1;
            			else
            				return 1;}
            		
            	}
            }
         
            	public class Node{
            		long data;long color;
            		Node par;
            		public Node(long a) {
            			data=a;
            			
            		}
            	}
            	
            static final int MAXN = 100001;
       	 
        	// stores smallest prime factor for every number
        	static int spf[] = new int[MAXN];
        	 
        	// Calculating SPF (Smallest Prime Factor) for every
        	// number till MAXN.
        	// Time Complexity : O(nloglogn)
        	static void sieve()
        	{
        	    spf[1] = 1;
        	    for (int i=2; i<MAXN; i++)
        	 
        	        // marking smallest prime factor for every
        	        // number to be itself.
        	        spf[i] = i;
        	 
        	    // separately marking spf for every even
        	    // number as 2
        	    for (int i=4; i<MAXN; i+=2)
        	        spf[i] = 2;
        	 
        	    for (int i=3; i*i<MAXN; i++)
        	    {
        	        // checking if i is prime
        	        if (spf[i] == i)
        	        {
        	            // marking SPF for all numbers divisible by i
        	            for (int j=i*i; j<MAXN; j+=i)
        	 
        	                // marking spf[j] if it is not 
        	                // previously marked
        	                if (spf[j]==j)
        	                    spf[j] = i;
        	        }
        	    }
        	}
        	 
        	// A O(log n) function returning primefactorization
        	// by dividing by smallest prime factor at every step
        	static Vector<Integer> getFactorization(int x)
        	{
        	    Vector<Integer> ret = new Vector<>();
        	    while (x != 1)
        	    {
        	        ret.add(spf[x]);
        	        x = x / spf[x];
        	    }
        	    return ret;
        	}
        	 
            int d, x, y;
            void extendedEuclid(int A, int B) {
                if(B == 0) {
                    d = A;
                    x = 1;
                    y = 0;
                }
                else {
                    extendedEuclid(B, A%B);
                    int temp = x;
                    x = y;
                    y = temp - (A/B)*y;
                }
            }
            static final int MAX_SIZE = 1000001;
            // isPrime[] : isPrime[i] is true if number is prime 
            // prime[] : stores all prime number less than N
            // SPF[] that store smallest prime factor of number
            // [for Exp : smallest prime factor of '8' and '16'
            // is '2' so we put SPF[8] = 2 , SPF[16] = 2 ]
            static Vector<Boolean>isprime = new Vector<>(MAX_SIZE);
            static Vector<Integer>prime = new Vector<>();
            static Vector<Integer>SPF = new Vector<>(MAX_SIZE);
              
            // method generate all prime number less then N in O(n)
            static void manipulated_seive(int N)
            {
                // 0 and 1 are not prime
                isprime.set(0, false);
                isprime.set(1, false);
                 
                // Fill rest of the entries
                for (int i=2; i<N ; i++)
                {
                    // If isPrime[i] == True then i is
                    // prime number
                    if (isprime.get(i))
                    {
                        // put i into prime[] vector
                        prime.add(i);
              
                        // A prime number is its own smallest
                        // prime factor
                        SPF.set(i,i);
                    }
              
                    // Remove all multiples of  i*prime[j] which are
                    // not prime by making isPrime[i*prime[j]] = false
                    // and put smallest prime factor of i*Prime[j] as prime[j]
                    // [ for exp :let  i = 5 , j = 0 , prime[j] = 2 [ i*prime[j] = 10 ]
                    // so smallest prime factor of '10' is '2' that is prime[j] ]
                    // this loop run only one time for number which are not prime
                    for (int j=0;
                         j < prime.size() &&
                         i*prime.get(j) < N && prime.get(j) <= SPF.get(i);
                         j++)
                    {
                        isprime.set(i*prime.get(j),false);
              
                        // put smallest prime factor of i*prime[j]
                        SPF.set(i*prime.get(j),prime.get(j)) ;
                    }
                }
            }
            

            int modularExponentiation(long x,long n)
            {
                if(n==0)
                    return 1;
                else if(n%2 == 0)        //n is even
                    return modularExponentiation((x*x),n/2);
                else                             //n is odd
                    return (int) ((x*modularExponentiation((x*x),(n-1)/2)));

            }
            
            
            
         
            long modularExponentiation(long x,long n,long M)
            {
                if(n==0)
                    return 1;
                else if(n%2 == 0)        //n is even
                    return modularExponentiation((x*x)%M,n/2,M);
                else                             //n is odd
                    return (long) ((x*modularExponentiation((x*x)%M,(n-1)/2,M))%M);

            }
            
            
            
            
            
            public int bfs(HashSet<Integer>[] adil,int n){
                int c=0;
                int[] shortdis=new int[n+1];
                Arrays.fill(shortdis,(int)1e5);
                LinkedList<Integer> queue=new LinkedList<Integer>();
                queue.add(1);
                shortdis[1]=0;
                while(queue.size()!=0){
                       int cc=queue.removeFirst();
                       Iterator<Integer> it=adil[cc].iterator();
                       while(it.hasNext()){
                              int f=it.next();
                              if(shortdis[f]==1e5){
                                     shortdis[f]=shortdis[cc]+1;
                                     queue.add(f);
                              }
                       }
                }
                return(shortdis[n]);
         }         
            
          /*  boolean[] sieveOfEratosthenes(int n)
            {
            	
                // (a / b) % m = (a % m * b^(m - 2) % m) % mCreate a boolean array "prime[0..n]" and initialize
                // all entries it as true. A value in prime[i] will
                // finally be false if i is Not a prime, else true.
                boolean prime[] = new boolean[n+1];
                for(int i=0;i<n;i++)
                    prime[i] = true;
                 
                for(int p = 2; p*p <=n; p++)
                {
                    // If prime[p] is not changed, then it is a prime
                    if(prime[p] == true)
                    {
                        // Update all multiples of p
                        for(int i = p*2; i <= n; i += p)
                            prime[i] = false;
                    }
                }
                 
                // Print all prime numbers
               return prime;
            }
            
   /*         void DFS(int v,boolean visited[])
    {
        // Mark the current node as visited and print it
        visited[v] = true;
        System.out.print(v+" ");
 
        // Recur for all the vertices adjacent to this vertex
        Iterator<Integer> i = adj[v].listIterator();
        while (i.hasNext())
        {
            int n = i.next();
            if (!visited[n])
                DFS(n, visited);
        }
    }*/
    /*static int binomialCoeff(int n, int k)
    {
        int C[] = new int[k + 1];
        
        // nC0 is 1
        C[0] = 1;  
      
        for (int i = 1; i <= n; i++)
        {
            // Compute next row of pascal 
            // triangle using the previous row
            for (int j = Math.min(i, k); j > 0; j--)
                C[j] = C[j] + C[j-1];
        }
        return C[k];
    }*/
         
          FastReader sc=new FastReader();
static class FastReader
    {
        BufferedReader br;
        StringTokenizer st;
 
        public FastReader()
        {
            br = new BufferedReader(new
                     InputStreamReader(System.in));
        }
 
        String next()
        {
            while (st == null || !st.hasMoreElements())
            {
                try
                {
                    st = new StringTokenizer(br.readLine());
                }
                catch (IOException  e)
                {
                    e.printStackTrace();
                }
            }
            return st.nextToken();
        }
 
        int nextInt()
        {
            return Integer.parseInt(next());
        }
 
        long nextLong()
        {
            return Long.parseLong(next());
        }
 
        double nextDouble()
        {
            return Double.parseDouble(next());
        }
 
        String nextLine()
        {
            String str = "";
            try
            {
                str = br.readLine();
            }
            catch (IOException e)
            {
                e.printStackTrace();
            }
            return str;
        }
    }
public class Pair implements Comparable<Pair> {
	  final long u;
	  final long v;

	  public Pair(long u, long v) {
	    this.u = u;
	    this.v = v;
	  }

	  public int hashCode() {
	    int hu = (int) (u ^ (u >>> 32));
	    int hv = (int) (v ^ (v >>> 32));
	    return 31 * hu + hv;
	  }

	  public boolean equals(Object o) {
	    Pair other = (Pair) o;
	    return u == other.u && v == other.v;
	  }

	  public int compareTo(Pair other) {
	    return Long.compare(u, other.u) != 0 ? Long.compare(u, other.u) : Long.compare(v, other.v);
	  }

	  public String toString() {
	    return "[u=" + u + ", v=" + v + "]";
	  }


}


}