import bisect import copy import decimal import fractions import heapq import itertools import math import random import sys import time from collections import Counter,deque,defaultdict from functools import lru_cache,reduce from heapq import heappush,heappop,heapify,heappushpop,_heappop_max,_heapify_max def _heappush_max(heap,item): heap.append(item) heapq._siftdown_max(heap, 0, len(heap)-1) def _heappushpop_max(heap, item): if heap and item < heap[0]: item, heap[0] = heap[0], item heapq._siftup_max(heap, 0) return item from math import gcd as GCD read=sys.stdin.read readline=sys.stdin.readline readlines=sys.stdin.readlines write=sys.stdout.write sys.setrecursionlimit(10**6) @lru_cache(maxsize=None) def solve(N,cnt): if N<=3: retu=0 for n in range(1,N): if n==cnt: retu+=1 else: retu=0 for n in range(1,3): if n==cnt: retu+=1 retu+=solve((N+4)//5,cnt) retu+=solve((N+3)//5,cnt-1) retu+=solve((N+2)//5,cnt-2) retu+=solve((N+6)//5,cnt+2) retu+=solve((N+5)//5,cnt+1) return retu N=int(readline()) ans=solve(N+1,0) print(ans)