Nguyễn Phúc Tâm

var
  n, res: longint;
  a, t: array[-7..100007] of longint;
procedure solve(i: longint);
var p: longint;
begin
    for p := i downto 1 do
      if (a[p] > 3) then exit();
    inc(res);
end;
procedure trh(i: longint);
var j: longint;
begin
    for j := a[i-1] to (n - t[i-1]) div 2 do
      begin
          a[i] := j;
          t[i] := t[i-1] + j;
          trh(i+1);
      end;
    a[i] := n - t[i-1];
    solve(i);
end;
begin
    assign(input,'bunny.inp');reset(input);
    assign(output,'bunny.out');rewrite(output);
    readln(n);
    t[0] := 0;
    a[0] := 1;
    res := 0;
    trh(1);
    writeln(res);
    close(input);close(output);
end.