{"problem":{"name":"Div","description":{"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?","description_type":"Markdown"},"platform":"AtCoder","limit":{"time_limit":2000,"memory_limit":262144},"difficulty":"None","is_remote":true,"is_sync":true,"sync_url":null,"sign":"abc198_a"},"statements":[{"statement_type":"Markdown","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?\n\n## Constraints\n\n*   $N$ is an integer.\n*   $1 \\leq N \\leq 15$\n\n## Input\n\nInput is given from Standard Input in the following format:\n\n$N$\n\n[samples]","is_translate":false,"language":"English"}],"meta":{"iden":"abc198_a","tags":[],"sample_group":[["2","1\n\nThere is only one way to share the sweets: A and B get one sweet each."],["1","0"],["3","2"]],"created_at":"2026-03-03 11:01:13"}}