using System.Linq;
using System.Collections.Generic;
using System;

public class PriorityQueue<T> where T : IComparable
{
    private IComparer<T> _comparer = null;
    private int _type = 0;
    private T[] _heap;
    private int _sz = 0;
    private int _count = 0;
    /// <summary>
    /// Priority Queue with custom comparer
    /// </summary>
    public PriorityQueue(int maxSize, IComparer<T> comparer)
    {
        _heap = new T[maxSize];
        _comparer = comparer;
    }

    /// <summary>
    /// Priority queue
    /// </summary>
    /// <param name="maxSize">max size</param>
    /// <param name="type">0: asc, 1:desc</param>
    public PriorityQueue(int maxSize, int type = 0)
    {
        _heap = new T[maxSize];
        _type = type;
    }
    private int Compare(T x, T y)
    {
        if (_comparer != null) return _comparer.Compare(x, y);
        return _type == 0 ? x.CompareTo(y) : y.CompareTo(x);
    }
    public void Push(T x)
    {
        _count++;
        //node number
        var i = _sz++;
        while (i > 0)
        {
            //parent node number
            var p = (i - 1) / 2;

            if (Compare(_heap[p], x) <= 0) break;

            _heap[i] = _heap[p];
            i = p;
        }
        _heap[i] = x;
    }
    public T Pop()
    {
        _count--;
        T ret = _heap[0];
        T x = _heap[--_sz];

        int i = 0;
        while (i * 2 + 1 < _sz)
        {
            //children
            int a = i * 2 + 1;
            int b = i * 2 + 2;

            if (b < _sz && Compare(_heap[b], _heap[a]) < 0) a = b;

            if (Compare(_heap[a], x) >= 0) break;

            _heap[i] = _heap[a];
            i = a;
        }
        _heap[i] = x;
        return ret;
    }
    public int Count()
    {
        return _count;
    }
    public T Peek()
    {
        return _heap[0];
    }
    public bool Contains(T x)
    {
        for (int i = 0; i < _sz; i++) if (x.Equals(_heap[i])) return true;
        return false;
    }
    public void Clear()
    {
        while (this.Count() > 0) this.Pop();
    }
    public IEnumerator<T> GetEnumerator()
    {
        var ret = new List<T>();
        while (this.Count() > 0)
        {
            ret.Add(this.Pop());
        }
        foreach (var r in ret)
        {
            this.Push(r);
            yield return r;
        }
    }
    public T[] ToArray()
    {
        T[] array = new T[_sz];
        int i = 0;
        foreach (var r in this)
        {
            array[i++] = r;
        }
        return array;
    }
}
public class P : IComparable
{
    public int id { get; set; }
    public int m { get; set; }
    public int t { get; set; }
    public bool a { get; set; }
    public int CompareTo(object obj)
    {
        var x = (P)obj;
        if (this.t > x.t) return 1;
        else if (this.t == x.t) return 0;
        else return -1;
    }
}

public class hello
{
    public static int[] sheet;
    public static void Main()
    {
        var pq = new PriorityQueue<P>(500, 0);
        for (int i = 0; i < 100; i++)
        {
            var m = i % 5 == 1 ? 5 : 2;
            pq.Push(new P { a = true, id = i, m = m, t = 5 * i });
        }
        var wait = new int[100];
        var q = new Queue<P>();
        sheet = new int[17];
        for (int i = 0; i < 17; i++) sheet[i] = -1;
        while (pq.Count() > 0)
        {
            var w = pq.Pop();
            if (w.a) q.Enqueue(w);
            else remove(w.id);
            while (true)
            {
                if (q.Count() == 0) break;
                var w2 = q.Peek();
                if (check(w2.id, w2.m))
                {

                    var t = 17 * (w2.id % 2) + 3 * (w2.id % 3) + 19;
                    var m = w2.m;
                    pq.Push(new P { a = false, id = w2.id, m = m, t = w.t + t });

                    q.Dequeue();
                    wait[w2.id] = w.t - 5 * w2.id;
                }
                else break;
            }
        }
        string s;
        for (; (s = Console.ReadLine()) != null;)
        {
            var n = int.Parse(s.Trim());
            Console.WriteLine(wait[n]);
        }
    }
    static void remove(int id)
    {
        for (int i = 0; i < 17; i++)
            if (sheet[i] == id) sheet[i] = -1;
    }
    static bool check(int id, int m)
    {
        var p = 0;
        var count = 0;
        var flag = false;
        while (p < 17)
        {
            if (sheet[p] == -1)
            {
                count++;
                if (flag)
                    if (count == m)
                    {
                        for (int i = 0; i < m; i++) sheet[p - i] = id;
                        return true;
                    }
                    else flag = true;
                else flag = true;
            }
            else { flag = false; count = 0; }
            p++;
        }
        return false;
    }
}



Measured memory_bytes: 16732