const
    a:array[1..3] of longint=(1,2,6);

var
    n,i,j:longint;
    f:array[-10..110,0..3] of longint;

begin
reset(input,'input.txt');
rewrite(output,'output.txt');
fillchar(f,sizeof(f),0);
read(n);
for i:=1 to n do
    f[i][0]:=1;
for i:=1 to n do
    for j:=1 to 3 do
        if i>=a[j] then
            f[i][j]:=f[i-a[j]][j]+f[i][j-1];
write(f[n][3]);
end.