#include <iostream>
using namespace std;
int min(int a[],int n){
	int nn=0;
	long long int minn=999999999;
for(int i=0;i<n;i++){
	if(a[i]==-1)
		continue;
	else if(a[i]<minn)
		minn=a[i];
}
//cout << minn <<endl;
return minn;
}
int mini(int a[],int n){
	int nn=0,minii=0;
	long long int minn=999999999;
for(int i=0;i<n;i++){
	if(a[i]==-1)
		continue;
	else if(a[i]<minn){
		minn=a[i];
		minii=i;
	}
}
//cout << minn <<endl;
return minii;
}
int main(){
	int a[1005],b[1005],n=0,count=0,index=0;
	while(cin >> n){
		for(int i=0;i<1005;i++)
		a[i]=-1;
	    for(int i=0;i<n;i++)
		cin >> a[i];
		//排序=================================================
		for(int i=0;i<n;i++){
			for(int j=n-2;j>=i;j--){
				if(a[j+1]<a[j]){
					index=a[j+1];
					a[j+1]=a[j];
					a[j]=index;
				}
		}
		}
		int c=0,d=0,cc=0;
		long long int sum=0;
for(int i=0;i<n-1;i++){
		
	c=min(a,n);//找出最...