{"raw_statement":[{"iden":"problem statement","content":"You are given a string $S$ of length $3$ consisting of lowercase English letters.\nHow many different strings can be obtained by permuting the characters in $S$?"},{"iden":"constraints","content":"*   $S$ is a string $S$ of length $3$ consisting of lowercase English letters."},{"iden":"input","content":"Input is given from Standard Input in the following format:\n\n$S$"},{"iden":"sample input 1","content":"aba"},{"iden":"sample output 1","content":"3\n\nBy permuting the characters in $S=$ `aba`, three different strings can be obtained: `aab`, `aba`, `baa`."},{"iden":"sample input 2","content":"ccc"},{"iden":"sample output 2","content":"1\n\nBy permuting the characters in $S=$ `ccc`, just one string can be obtained: `ccc`."},{"iden":"sample input 3","content":"xyz"},{"iden":"sample output 3","content":"6\n\nBy permuting the characters in $S=$ `xyz`, six different strings can be obtained: `xyz`, `xzy`, `yxz`, `yzx`, `zxy`, `zyx`."}],"translated_statement":null,"sample_group":[],"show_order":["default"],"formal_statement":null,"simple_statement":null,"has_page_source":true}