import std.algorithm, std.container, std.conv, std.math, std.range, std.typecons, std.stdio, std.string;

auto rdsp(){return readln.splitter;}
void pick(R,T)(ref R r,ref T t){t=r.front.to!T;r.popFront;}
void readV(T...)(ref T t){auto r=rdsp;foreach(ref v;t)pick(r,v);}

void main()
{
  int n; readV(n);

  int[] t;
  foreach (i; 0..n) {
    auto ti = i*(i+1)/2;
    if (ti > n) break;
    t ~= ti;
  }
  auto ts = t.assumeSorted;

  auto can1()
  {
    return ts.contains(n);
  }

  auto can2()
  {
    foreach (ti; t)
      if (ts.contains(n-ti)) return true;
    return false;
  }

  writeln(can1 ? 1 : can2 ? 2 : 3);
}