{"raw_statement":[{"iden":"problem statement","content":"Two boys, A and B, will share $N$ indistinguishable sweets. How many ways are there to do this so that each boy gets a positive integer number of sweets?"},{"iden":"constraints","content":"*   $N$ is an integer.\n*   $1 \\leq N \\leq 15$"},{"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":"1\n\nThere is only one way to share the sweets: A and B get one sweet each."},{"iden":"sample input 2","content":"1"},{"iden":"sample output 2","content":"0"},{"iden":"sample input 3","content":"3"},{"iden":"sample output 3","content":"2"}],"translated_statement":null,"sample_group":[],"show_order":["default"],"formal_statement":null,"simple_statement":null,"has_page_source":true}