output_description: Print the number of possible passwords.
  
  * * *
input_description: Input is given from Standard Input in the following format:
  
      
      
      N
attempt: def solve():
      data = read()
      result = think(data)
      write(result)
  
  
  def read():
      return read_int(1)[0]
  
  
  def read_int(n):
      return list(map(lambda x: int(x), read_line().split(" ")))[:n]
  
  
  def read_float(n):
      return list(map(lambda x: float(x), read_line().split(" ")))[:n]
  
  
  def read_line(n=0):
      if n == 0:
          return input().rstrip()
      else:
          return input().rstrip()[:n]
  
  
  def think(data):
      return data**3
  
  
  def write(result):
      print(result)
  
  
  if __name__ == "__main__":
      # import doctest
      # doctest.testmod()
      # import sys
      # sys.setrecursionlimit(10000)
      solve()
  
problem_description: Statement
  
  Takahashi is going to set a 3-character password.
  
  How many possible passwords are there if each of its characters must be a
  digit between 1 and N (inclusive)?
samples: [{"input": "2", "output": "8\n    \n\nThere are eight possible passwords: `111`, `112`, `121`, `122`, `211`, `212`,\n`221`, and `222`.\n\n* * *"}, {"input": "1", "output": "1\n    \n\nThere is only one possible password if you can only use one kind of character."}]