【水搜索】#31 A. Worms Evolution

A. Worms Evolution

time limit per test

2 seconds

memory limit per test

256 megabytes

input

standard input

output

standard output

Professor Vasechkin is studying evolution of worms. Recently he put forward hypotheses that all worms evolve by division. There are nforms of worms. Worms of these forms have lengths a₁, a₂, ..., a_n. To prove his theory, professor needs to find 3 different forms that the length of the first form is equal to sum of lengths of the other two forms. Help him to do this.

Input

The first line contains integer n (3 ≤ n ≤ 100) — amount of worm's forms. The second line contains n space-separated integers a_i (1 ≤ a_i ≤ 1000) — lengths of worms of each form.

Output

Output 3 distinct integers i j k (1 ≤ i, j, k ≤ n) — such indexes of worm's forms that a_i = a_j + a_k. If there is no such triple, output -1. If there are several solutions, output any of them. It possible that a_j = a_k.

Sample test(s)

input

5
1 2 3 5 7

output

3 2 1

input

5
1 8 1 5 1

output

-1

还亏我想了半天……这道题暴力O (n^3)都能无压力A……

那就直接水掉吧~ FORFORFOR 检测flag~ over~

Code：8k 30ms AC

#include    
#include   
#include   
#include   
#include   
#include 
#define FOR(a,b) for(a=b;a