import sys
read=sys.stdin.buffer.read
readline=sys.stdin.buffer.readline
readlines=sys.stdin.buffer.readlines

def calc(mx):
    dp=[1]
    for i in range(6):
        newdp=[0]*(mx*(i+1)+1)
        for j in range(mx+1):
            for k in range(mx*i+1):
                newdp[k+j]+=dp[k]
        dp=newdp
    return dp
x=int(readline().decode().replace(".", ""))*4//100
dps=[calc(i) for i in range(101)]
def solve1(a, b, s):
    s-=6*a
    if s<0 or b-a<0 or b-a>100 or s>=len(dps[b-a]):
        return 0
    return dps[b-a][s]
def solve(a, b):
    return solve1(a, b, x+a+b)-solve1(a+1, b, x+a+b)-solve1(a, b-1, x+a+b)+solve1(a+1, b-1, x+a+b)
ans=0
from itertools import combinations_with_replacement
for a, b in combinations_with_replacement(range(101), 2):
    ans+=solve(a, b)
print(ans)