#define _CRT_SECURE_NO_WARNINGS
#define _USE_MATH_DEFINES
#include <cfloat>
#include <climits>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <ctime>
#include <iostream>
#include <memory>
#include <string>

#include <algorithm>
#include <complex>
#include <list>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <stack>
#include <vector>
#include <bitset>

using namespace std;

#ifdef _MSC_VER
#define __typeof__ decltype
#define strtok_r strtok_s
#endif

#define ITER(c)             __typeof__((c).begin())
#define FOREACH(it, c)      for (ITER(c) it=(c).begin(); it != (c).end(); ++it)
#define RITER(c)            __typeof__((c).rbegin())
#define RFOREACH(it, c)     for (RITER(c) it=(c).rbegin(); it != (c).rend(); ++it)
#define REP(i, n)           REPEAT(i, 0, n)
#define RREP(i, n)          RREPEAT(i, 0, n)
#define REPEAT(i, k, n)     for(int i = (k); i < ((k)+(n)); ++i)
#define RREPEAT(i, k, n)    for(int i = (k)+(n)-1; i >= (k); --i)
#define FROMTO(i,f,t)       for(int i = f; i < t; i++)
#define ALL(c)              (c).begin(), (c).end()
#define LLPOW(p1,p2)        ((ll)pow((double)(p1), (int)p2))
#define ESIZEOF(A)          (sizeof(A)/sizeof((A)[0]))
#define CIN_NO_SYNC         do { cin.tie(0); ios_base::sync_with_stdio(false); } while(0)
#define GETSTR(p)           fgets((p), sizeof(p), stdin)
#define CHOMP(p)            do{ char *_q = (p) + strlen(p)-1; if(*_q == '\n' || *_q == '\r') *_q = 0; } while(0)
#define FILL(m,v)           memset(m, v, sizeof(m))
#define mp                  make_pair
#define pb                  push_back
template<class _T> _T MAX(_T p1,_T p2){return (p1>p2)?p1:p2;} 
template<class _T> _T MIN(_T p1,_T p2){return (p1<p2)?p1:p2;} 
template <class _Tv> inline string join(const _Tv &v,string sep=" "){
    ostringstream s;FOREACH(it,v){if(it!=v.begin())s<<sep;s<<*it;};return s.str();
}

typedef long long ll;
typedef unsigned long long ull;
typedef double D;
typedef complex<D> P;
#define X real()
#define Y imag()
#define EPS (1e-9)
#define DEQ(p1,p2) (abs((p1)-(p2)) < EPS)

#ifdef _DEBUG
template<class _Tv> inline void _prfe(const char *_n,const _Tv _c,bool _p=false){
    ITER(_c) _it=_c.begin();
    if(_p){cout<<_n<<" = ["<<endl;for(;_it!=_c.end();++_it)cout<<"    "<<*_it<<endl;cout<<"]"<<endl; }
    else{cout<<_n<<" = [ "<<*_it++;for(;_it!=_c.end();++_it)cout<<", "<<*_it;cout<<" ]"<<endl; }
}
#define pf printf
#define pr(n) do{cout<<#n" = "<<(n)<<endl;}while(0)
#define prfe(n) _prfe(#n, n)
#define prfep(n) _prfe(#n, n, true)
#define dbgchk(n) do{if(n)throw;}while(0)
#else
#define pf(...) /* */
#define pr(...) /* */
#define prfe(...) /* */
#define prfep(...) /* */
#define dbgchk(...) /* */
#endif

const int visnum = 100;
const int seatnum = 17;
int seat[seatnum];
int sett[visnum];
int wait[visnum];

void solve(){
    deque<pair<pair<int,int>,int> > q;
    FILL(seat,-1);
    for(int t = 0; t < 500 || !q.empty(); t++){
        int idx, num, wtt;
        if(t < 500 && t % 5 == 0){
            idx = t/5; num = idx%5==1?5:2;
            q.pb(mp(mp(idx,num),0));
        }
        REP(i,seatnum){
            if(seat[i] < 0) continue;
            idx = seat[i];
            if(sett[idx] + 17*(idx%2)+3*(idx%3)+19 <= t){
                seat[i] = -1;
            }
        }

        while(!q.empty()){
            int ss = -1, sn = 0;
            idx = q.front().first.first;
            num = q.front().first.second;
            wtt = q.front().second;
            REP(i,seatnum){
                if(seat[i] < 0){
                    if(ss < 0) ss = i, sn = 0;
                    sn++;
                    if(sn >= num) break;
                } else ss = -1;
            }

            if(ss >= 0 && sn >= num){
                q.pop_front();
                REPEAT(i,ss,sn) seat[i] = idx;
                sett[idx] = t;
                wait[idx] = wtt;
            } else break;
        }
        FOREACH(it,q) it->second++;

#ifdef _DEBUG
        pf("time [%d]\n", t);
        pf("q = "); FOREACH(it,q) pf("(%d,%d,%d), ", it->first.first, it->first.second, it->second); pf("\n");
        pf("s = "); REP(i,seatnum) if(seat[i]<0)pf("-- "); else pf("%2d ", seat[i]); pf("\n");
#endif
    }
    return;
}


int main(){
    solve();
    int n;
    while(cin >> n){
        if(n < 0 || n >= 100) throw;
        cout << wait[n] << endl;
    }
    return 0;
}

Measured memory_bytes: 1200