#include <iostream>
#include <algorithm>
#include <functional>
using namespace std;
int n;
int v[1001];
int main()
{
int i,j,k;
int mz;
while(scanf("%d",&n)==1 && n)
{
for(i=0;i<n;i++)
scanf("%d",&v[i]);
sort(&v[0],&v[n],less<int>());//从小到大排序
for(i=n-1;i>=0;i--)
for(j=0;j<n;j++)
for(k=j+1;k<n;k++)
if(i!=j && i!=k)
{
mz = v[i]-v[j]-v[k];
if(mz != v[j] && mz!=v[k] && mz != v[i])
{
if(binary_search(&v[0],&v[n],mz))//if(binary_search(&v[0],&v[n],mz,less<int>()))
goto FOUND;
}
}
printf("no solution/n");
continue;//提前结束本次循环
FOUND:
printf("%d/n",v[i]);
}
return 0;
}