#include <algorithm>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <iostream>
#include <iterator>
#include <list>
#include <map>
#include <queue>
#include <set>
#include <sstream>
#include <stack>
#include <string>
#include <valarray>
#include <vector>

#define N 1000
#define re(i,n) for(int i=0;i<(n);i++)
#define rep(i,a,b) for(int i=(a);i<(b);i++)
#define fe(i,n,f) for_each(i,n,f)
#define bw(a,b,c) (((a)<=(b))&&((b)<=(c)))
using namespace std;

typedef long long ll;
typedef unsigned long long ull;

int g=0;

bool c(int k){
	return k<=g;
}

int main(void){
	int n,a[100];
	int s=0;
	cin>>n;
	re(i,n)cin>>a[i],s+=a[i];
	g=s/10;
	cout<<count_if(a,a+n,c)*30<<endl;

	return 0;
}