output_description: For each insert operation, print the number of elements in $S$.  
  For each find operation, print the number of specified elements in $S$.
input_description: The input is given in the following format.
  
      
      
      $q$
      $query_1$
      $query_2$
      :
      $query_q$
      
  
  Each query $query_i$ is given by
  
      
      
      0 $x$
      
  
  or
  
      
      
      1 $x$
      
  
  where the first digits 0 and 1 represent insert and find operations
  respectively.
attempt: def solve():
      from sys import stdin
  
      f_i = stdin
  
      q = int(f_i.readline())
      d = {}
      ans = []
      cnt = 0
      for i in range(q):
          op, x = map(int, f_i.readline().split())
          if op == 0:
              if d.setdefault(x, "0") == "0":
                  d[x] = "1"
                  cnt += 1
              ans.append(str(cnt))
          else:
              ans.append(d.setdefault(x, "0"))
      print("\n".join(ans))
  
  
  solve()
  
problem_description: Set: Search
  
  For a set $S$ of integers, perform a sequence of the following operations.
  Note that _each value in $S$ must be unique_.
  
    * insert($x$): Insert $x$ to $S$ and report the number of elements in $S$ after the operation.
    * find($x$): Report the number of $x$ in $S$ (0 or 1).
samples: [{"input": "7\n    0 1\n    0 2\n    0 3\n    0 2\n    0 4\n    1 3\n    1 10", "output": "1\n    2\n    3\n    3\n    4\n    1\n    0"}]