output_description: Print the number of ways to choose a pair of an even number and an odd number
  from the positive integers between 1 and K (inclusive).
  
  * * *
input_description: Input is given from Standard Input in the following format:
  
      
      
      K
attempt: import sys
  
  
  l = int(input())
  
  if l > 262144:
      print("-1")
      sys.exit()
  
  
  t = 0
  while l > 2**t:
      t += 1
  print(t, t + 2, 0)
  print(t, t + 1, 0)
  print(t + 1, t + 2, 1)
  if t >= 2:
      for i in range(1, t):
          if i == 1:
              print(i, i + 1, 0)
          else:
              print(i, i + 1, 0)
              print(i, i + 1, 2 ** (t - i))
  bin_str = format(l - 2 ** (t - 1), "0" + str(t) + "b")
  
  list = [2 ** (w - 1) for w in range(t, 0, -1)]
  p = 0
  c = 0
  
  for j in range(len(str(bin_str))):
      if str(bin_str[j]) == "1":
          if j == 0:
              print(1, 2, 2 ** (t - 1))
          else:
              c += list[p]
              p = j
              print(1, j + 2, c)
  
problem_description: Statement
  
  Find the number of ways to choose a pair of an even number and an odd number
  from the positive integers between 1 and K (inclusive). The order does not
  matter.
samples: [{"input": "3", "output": "2\n    \n\nTwo pairs can be chosen: (2,1) and (2,3).\n\n* * *"}, {"input": "6", "output": "9\n    \n\n* * *"}, {"input": "11", "output": "30\n    \n\n* * *"}, {"input": "50", "output": "625"}]