{"raw_statement":[{"iden":"problem statement","content":"Takahashi is going to set a $3$\\-character password.\nHow many possible passwords are there if each of its characters must be a digit between $1$ and $N$ (inclusive)?"},{"iden":"constraints","content":"*   $1 \\leq N \\leq 9$\n*   $N$ is an integer."},{"iden":"input","content":"Input is given from Standard Input in the following format:\n\n$N$"},{"iden":"sample input 1","content":"2"},{"iden":"sample output 1","content":"8\n\nThere are eight possible passwords: `111`, `112`, `121`, `122`, `211`, `212`, `221`, and `222`."},{"iden":"sample input 2","content":"1"},{"iden":"sample output 2","content":"1\n\nThere is only one possible password if you can only use one kind of character."}],"translated_statement":null,"sample_group":[],"show_order":["default"],"formal_statement":null,"simple_statement":null,"has_page_source":true}