output_description: Print the area of a circle of radius r, divided by the area of a circle of
  radius 1, as an integer.
  
  * * *
input_description: Input is given from Standard Input in the following format:
  
      
      
      r
attempt: X, Y = map(int, input().split())
  n = (2 * X - Y) / 3
  m = (2 * Y - X) / 3
  
  if n < 0 or m < 0 or not n.is_integer() or not m.is_integer():
      print(0)
      exit()
  
  MOD = 10**9 + 7
  
  
  class ModInt:
      def __init__(self, x):
          self.x = x % MOD
  
      def __str__(self):
          return str(self.x)
  
      __repr__ = __str__
  
      def __add__(self, other):
          return (
              ModInt(self.x + other.x)
              if isinstance(other, ModInt)
              else ModInt(self.x + other)
          )
  
      def __sub__(self, other):
          return (
              ModInt(self.x - other.x)
              if isinstance(other, ModInt)
              else ModInt(self.x - other)
          )
  
      def __mul__(self, other):
          return (
              ModInt(self.x * other.x)
              if isinstance(other, ModInt)
              else ModInt(self.x * other)
          )
  
      def __truediv__(self, other):
          return (
              ModInt(self.x * pow(other.x, MOD - 2, MOD))
              if isinstance(other, ModInt)
              else ModInt(self.x * pow(other, MOD - 2, MOD))
          )
  
      def __pow__(self, other):
          return (
              ModInt(pow(self.x, other.x, MOD))
              if isinstance(other, ModInt)
              else ModInt(pow(self.x, other, MOD))
          )
  
      __radd__ = __add__
  
      def __rsub__(self, other):
          return (
              ModInt(other.x - self.x)
              if isinstance(other, ModInt)
              else ModInt(other - self.x)
          )
  
      __rmul__ = __mul__
  
      def __rtruediv__(self, other):
          return (
              ModInt(other.x * pow(self.x, MOD - 2, MOD))
              if isinstance(other, ModInt)
              else ModInt(other * pow(self.x, MOD - 2, MOD))
          )
  
      def __rpow__(self, other):
          return (
              ModInt(pow(other.x, self.x, MOD))
              if isinstance(other, ModInt)
              else ModInt(pow(other, self.x, MOD))
          )
  
  
  n, m = map(int, [n, m])
  fact = [ModInt(1)]
  for i in range(1, X + Y + 1):
      fact.append(fact[i - 1] * i)
  
  
  def cmb(n, r):
      return fact[n] / fact[n - r] / fact[r]
  
  
  print(cmb(n + m, min(n, m)))
  
problem_description: Statement
  
  Given is an integer r.
  
  How many times is the area of a circle of radius r larger than the area of a
  circle of radius 1?
  
  It can be proved that the answer is always an integer under the constraints
  given.
samples: [{"input": "2", "output": "4\n    \n\nThe area of a circle of radius 2 is 4 times larger than the area of a circle\nof radius 1.\n\nNote that output must be an integer - for example, `4.0` will not be accepted.\n\n* * *"}, {"input": "100", "output": "10000"}]