#include<bits/stdc++.h> #define ll long long using namespace std; const int maxn=1e6+10; const ll inf=1e10; const ll mod=1e9+7; ll n,m; ll a[maxn],tmp[maxn]; int _gcd(int a,int b){ if(!b) return a; return _gcd(b,a%b); } ll q_pow(ll a,ll b){ ll tmp=1; while(b>0){ // cout<<b<<" "<<a<<" "<<tmp<<endl; if(b&1){ tmp=(tmp*a)%mod; } b>>=1; a=(a*a)%mod; } return tmp; } int main(){ // freopen("triple.in","r",stdin); //freopen("triple.out","w",stdout); scanf("%lld",&n); for(int i=1;i<=n;i++) scanf("%lld",&a[i]); if(n<=2) printf("-1 -1 -1"); else printf("1 2 3"); fclose(stdin); fclose(stdout); return 0; }