{"raw_statement":[{"iden":"problem statement","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}$."},{"iden":"constraints","content":"*   $12 \\le L \\le 200$\n*   $L$ is an integer."},{"iden":"input","content":"Input is given from Standard Input in the following format:\n\n$L$"},{"iden":"sample input 1","content":"12"},{"iden":"sample output 1","content":"1\n\nThere is only one way: to cut the bar into $12$ bars of length $1$ each."},{"iden":"sample input 2","content":"13"},{"iden":"sample output 2","content":"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."},{"iden":"sample input 3","content":"17"},{"iden":"sample output 3","content":"4368"}],"translated_statement":null,"sample_group":[],"show_order":["default"],"formal_statement":null,"simple_statement":null,"has_page_source":true}