#include<iostream>#include<vector>#include<map>#include<string>#include<cstring>#include<cstdio>#include<algorithm>#include<set>#include<queue>#include<unordered_map>#include<cmath>usingnamespace std;int n, a[110];intmain(){
cin >> n;for(int i =1; i <= n; i++){
cin >> a[i];}for(int i =1; i <= n; i++){for(int j = i +1; j <= n; j++){int cnt1 =0, cnt2 =0;for(int k =1; k <= n; k++){if(a[k]<0){if(-a[k]!= i &&-a[k]!= j){if(k == i || k == j)
cnt2++;if(k != i && k != j)
cnt1++;}}elseif(a[k]>0){if(a[k]== i || a[k]== j){if(k == i || k == j)
cnt2++;if(k != i && k != j)
cnt1++;}}}if(cnt2 ==1&& cnt1 + cnt2 ==2){printf("%d %d", i, j);return0;}}}printf("No Solution");}