A. Balloons Codeforces Round #493 (Div. 2)

A. Balloons

time limit per test

1 second

memory limit per test

256 megabytes

input

standard input

output

standard output

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\le n\le 10$) — the number of packets with balloons.

The second line contains $n$ integers: $a_1$, $a_2$, $\dots$, $a_n$ ($1\le a_i\le 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

Copy

3
1 2 1

output

Copy

2
1 2

input

Copy

2
5 5

output

Copy

-1

input

Copy

1
10

output

Copy

-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.

题意：将一组数据分组，满足没组至少一个，且不想等就行，输出一种方案，注意要输出的是数据的下标而不是值，不然会w7。

题解：将数组排一下序，取第一个和后面几个的和（这样能最大程度上保证不等，也要注意只有一个数的时候），如果相等则无方案，不等则，第一组只方排序后最小到的那个数就好。

代码：如果觉得题解可以欢迎关注评论，如果觉得不好，也欢迎评论提意见，我会加以改进的

#include <bits/stdc++.h>
using namespace std;
int n;
int a[20]; 
int b[20];
int sum=0;
int main()
{
	cin>>n;
	sum=0;
	for(int i=0;i<n;i++)
	{
		cin>>a[i];
		b[i]=a[i];
	}
	sort(a,a+n);
	for(int i=1;i<n;i++)
	{
		sum+=a[i];
	}
	if(a[0]==sum||sum==0||a[0]==0)
		cout<<-1<<endl;
	else
	{
		cout<<1<<endl;
		for(int i=0;i<n;i++)
		{
			if(a[0]==b[i])
			{
				cout<<i+1<<endl;
				break;
			}
				
		}
	}
	
}