{"problem":{"name":"Duodecim Ferra","description":{"content":"There is an iron bar of length $L$ lying east-west. We will cut this bar at $11$ positions to divide it into $12$ bars. Here, each of the $12$ resulting bars must have a positive integer length.   Fin","description_type":"Markdown"},"platform":"AtCoder","limit":{"time_limit":2000,"memory_limit":262144},"difficulty":"None","is_remote":true,"is_sync":true,"sync_url":null,"sign":"abc185_c"},"statements":[{"statement_type":"Markdown","content":"There is an iron bar of length $L$ lying east-west. We will cut this bar at $11$ positions to divide it into $12$ bars. Here, each of the $12$ resulting bars must have a positive integer length.  \nFind the number of ways to do this division. Two ways to do the division are considered different if and only if there is a position cut in only one of those ways.  \nUnder the constraints of this problem, it can be proved that the answer is less than $2^{63}$.\n\n## Constraints\n\n*   $12 \\le L \\le 200$\n*   $L$ is an integer.\n\n## Input\n\nInput is given from Standard Input in the following format:\n\n$L$\n\n[samples]","is_translate":false,"language":"English"}],"meta":{"iden":"abc185_c","tags":[],"sample_group":[["12","1\n\nThere is only one way: to cut the bar into $12$ bars of length $1$ each."],["13","12\n\nJust one of the resulting bars will be of length $2$. We have $12$ options: one where the westmost bar is of length $2$, one where the second bar from the west is of length $2$, and so on."],["17","4368"]],"created_at":"2026-03-03 11:01:14"}}