#include"stdio.h"
#include"iostream"
#include"math.h"
#include"stdlib.h"
using namespace std;
long long a[100006],ans=9223372036854775807,tmp;
int g[10]={0,1,1,2,2};
int n;
int cmp(const void *a,const void *b)
{
return *(long long *)a-*(long long *)b;
}
int main()
{
freopen("queue.in","r",stdin);
freopen("queue.out","w",stdout);
scanf("%d",&n);
for(int i=0;i<n;i++)
scanf("%lld",&a[i]);
qsort(a,n,sizeof(a[0]),cmp);
for(int i=0;i<5;i++)
{
tmp=0;
for(int j=0;j<n;j++)
tmp+=(a[j]-a[0]+i)/5+g[(a[j]-a[0]+i)%5];
if(tmp<ans)
ans=tmp;
}
printf("%lld",ans);
return 0;
}