#include <bits/stdc++.h>
using namespace std;
#define rep(i,n) for(int i=0;i<(n);i++)
#define MP make_pair
#define PB push_back
typedef long long ll;
const int N_MAX=1300000;
bool prime[N_MAX];
int main(){
	int n,c;
	ll cnt[100],sum=0;
	cin>>n;
	rep(i,n){
		cin>>cnt[i];
		sum+=cnt[i];
	}
	int k=sum/10,ans=0;
	rep(i,n)if(cnt[i]<=k)ans+=30;
	cout<<ans<<endl;
}