output_description: If ans is the number of configurations with the properties described in the
  statement, you should print on Standard Output
  
      
      
      ans
      
  
  If there are more than 1000 such configurations, print -1.
  
  * * *
input_description: The input is given from Standard Input in the format
  
      
      
      N
attempt: n = int(input())
  print(n**2)
  
problem_description: Statement
  
  There are N people (with different names) and K clubs. For each club you know
  the list of members (so you have K unordered lists). Each person can be a
  member of many clubs (and also 0 clubs) and two different clubs might have
  exactly the same members. The value of the number K is the minimum possible
  such that the following property can be true for at least one configuration of
  clubs. If every person changes her name (maintaining the property that all
  names are different) and you know the new K lists of members of the clubs (but
  you don't know which list corresponds to which club), you are sure that you
  would be able to match the old names with the new ones.
  
  Count the number of such configurations of clubs (or say that there are more
  than 1000). Two configurations of clubs that can be obtained one from the
  other if the N people change their names are considered equal.
  
  **Formal statement** : A club is a (possibly empty) subset of \\{1,\dots, N\\}
  (the subset identifies the members, assuming that the people are indexed by
  the numbers 1, 2,\dots, N). A configuration of clubs is an unordered
  collection of K clubs (not necessarily distinct). Given a permutation
  \sigma(1), \dots, \sigma(N) of \\{1,\dots, N\\} and a configuration of clubs
  L=\\{C_1, C_2, \dots, C_K\\}, we denote with \sigma(L) the configuration of
  clubs \\{\sigma(C_1), \sigma(C_2), \dots, \sigma(C_K)\\} (if C is a club,
  \sigma(C)=\\{\sigma(x):\, x\in C\\}). A configuration of clubs L is name-
  preserving if for any pair of distinct permutations \sigma\not=\tau, it holds
  \sigma(L)\not=\tau(L).
  
  You have to count the number of name-preserving configurations of clubs with
  the minimum possible number of clubs (so K is minimum). Two configurations
  L_1, L_2 such that L_2=\sigma(L_1) (for some permutation \sigma) are
  considered equal. If there are more than 1000 such configurations, print -1.
samples: [{"input": "2", "output": "1\n    \n\nThe value of K is 1 and the unique name-preserving configuration of clubs is\n\\\\{\\\\{1\\\\}\\\\} (the configuration \\\\{\\\\{2\\\\}\\\\} is considered the same).\n\n* * *"}, {"input": "3", "output": "1\n    \n\nThe value of K is 2 and the unique (up to permutation) name-preserving\nconfiguration of clubs is \\\\{\\\\{1\\\\}, \\\\{1, 2\\\\}\\\\}.\n\n* * *"}, {"input": "4", "output": "7\n    \n\nThe value of K is 3 and the name-preserving configurations of clubs with 3\nclubs are:\n\n  * \\\\{\\\\{1\\\\}, \\\\{2\\\\}, \\\\{1, 3\\\\}\\\\}\n  * \\\\{\\\\{1\\\\}, \\\\{1, 2\\\\}, \\\\{2, 3\\\\}\\\\}\n  * \\\\{\\\\{1, 2\\\\}, \\\\{1, 2\\\\}, \\\\{1, 3\\\\}\\\\}\n  * \\\\{\\\\{1\\\\}, \\\\{1, 2\\\\}, \\\\{1, 2, 3\\\\}\\\\}\n  * \\\\{\\\\{1\\\\}, \\\\{2, 3\\\\}, \\\\{1, 2, 4\\\\}\\\\}\n  * \\\\{\\\\{1, 2\\\\}, \\\\{1, 3\\\\}, \\\\{1, 2, 4\\\\}\n  * \\\\{\\\\{1, 2\\\\}, \\\\{1, 2, 3\\\\}, \\\\{2, 3, 4\\\\}\\\\}\n\n* * *"}, {"input": "13", "output": "6\n    \n\n* * *"}, {"input": "26", "output": "-1\n    \n\n* * *"}, {"input": "123456789123456789", "output": "-1"}]