#include <cstdio> #include <algorithm> using namespace std; const int MAXN = 1005; int binarysearch(int A[],int low, int high, int x) { int mid; while (low <= high) { mid = low + (high - low) / 2; if (A[mid] < x) low = mid + 1; else if (A[mid] > x) high = mid - 1; else return mid; } return -1; } int main() { int n ; while (scanf("%d",&n),n) { int num[MAXN] = {0}; int i,j; for (i = 0; i < n; ++i) scanf("%d",num+i); sort(num, num+n); bool yes = false; for (j = n-1; j >= 0; --j) { for (i = 0; i < n; ++i) { if (i == j) continue; int e = num[j] - num[i]; for (int k = 0; k < n; ++k) { if (k == i || k == j) continue; int found = binarysearch(num,0,n-1,e-num[k]); if ((found != -1) && (found != k) && (found != i) && (found != j)) { yes = true; goto RESULT; } } } } RESULT: if (yes) printf("%d/n",num[j]); else puts("no solution"); } return 0; }