#include <iostream>
#include <algorithm>
using namespace std;
int r[]={0,1,5,8,9,10,17,17,20,24,30};
int cut(int n)
{
int money=0;
for(int t=1;t<=10;++t)//列举最后一种分割方案
{
if(n-t<0)
break;
money = max(money,cut(n-t)+r[t]);
}
return money;
}
int main()
{
int n;
cin>>n;
cout<<cut(n);
system("pause");
}