HDU 3420

#include <iostream>
#include <cstdio>
#include <cstdlib>
#include <algorithm>
#include <string>
#include <cstring> 
#include <vector>
#include <set>
#include <queue>
using namespace std;
const int MAXN = 1000 + 10;
typedef long long LL;

/*
HDU 3420
*/

int solve(vector<int> & v){
	int m = 0,tmp;
	queue<int> q;
	for(int i=0; i<v.size(); i++){
		q.push(v[i]);
	}
	while( q.size()>0 ){
		tmp = (q.size())*(q.front());
		m = max(m,tmp);
		q.pop();
	}
	return m;
}

int main(){
	int N=0;
	while( scanf("%d", &N)!=EOF ){
		vector<int> v;
		int sum=0,tmp;
		for(int i=0; i<N; i++){
			cin >> tmp;
			v.push_back(tmp);
		}
		sort(v.begin(),v.end()); 
		cout << solve(v) << endl;
	}
	return 0;
}