#include<iostream>
#include<algorithm>
#include<deque>
#include<cassert>
#define REP(i,s,n) for(int i=s;i<n;i++)
#define rep(i,n) REP(i,0,n)
#define inf (1<<29)
using namespace std;

int ans[200];
int seat[17];

int check(int n)
{
  int size = (n%5==1?5:2);
  int cnt = 0;
  rep(i,17)
    {
      if(seat[i] == 0)cnt++;
      else            cnt = 0;
      if(cnt >= size)
	return i-size+1;
    }
  return -1;
}

int main()
{
  rep(i,200)ans[i] = 0;
  int phase = 0;
  int group = 0;
  //17(i%2)+3(i%3)+19 
  deque<int> que;
  rep(i,17)seat[i] = 0;
  while(group < 11)
    {
      /*
      cout << phase << " --------- " << endl;
      if(!que.empty())
      cout << "top = " <<que.front() << endl;
      */
      if(phase%5 == 0)
	{
	  que.push_back(group++);
	}
      rep(i,17)if(seat[i] > 0)seat[i]--;
      int pos;

      while(!que.empty() && ((pos = check(que.front())) != -1) )
	{
	  int i = que.front();
	  int tm = 17 * (i % 2) + 3 * (i % 3) + 19;
	  REP(j,pos,pos+(i%5==1?5:2))
	    {
	      assert(seat[j] == 0);
	      seat[j] = tm;
	    }
	  que.pop_front();
	}

      for(deque<int>::iterator it = que.begin(); it != que.end();it++)
	{
	  ans[*it]++;
	}
      /*
      rep(i,16)cout << seat[i] << " ";
      cout << endl << endl;
      */
      phase++;
    }
  int n;
  while(cin >> n)cout << ans[n] << endl;
  return 0;
}