{"trustable":true,"prependHtml":"\u003cstyle type\u003d\"text/css\"\u003e\n h1 { font-size: 1.2em; }\n\u003c/style\u003e\n","sections":[{"title":"","value":{"format":"HTML","content":"\n\u003cdiv class\u003d\"md\"\u003e\u003cp\u003eA permutation of integers \u003cspan class\u003d\"math inline\"\u003e$ 1,2,\\ldots,n $\u003c/span\u003e is called \u003cem\u003ebeautiful\u003c/em\u003e if there are no adjacent elements whose difference is \u003cspan class\u003d\"math inline\"\u003e$ 1 $\u003c/span\u003e.\u003c/p\u003e\n\u003cp\u003eGiven \u003cspan class\u003d\"math inline\"\u003e$ n $\u003c/span\u003e, your task is to count the number of beautiful permutations.\u003c/p\u003e\n\u003ch1 id\u003d\"input\"\u003eInput\u003c/h1\u003e\n\u003cp\u003eThe only input line contains an integer \u003cspan class\u003d\"math inline\"\u003e$ n $\u003c/span\u003e.\u003c/p\u003e\n\u003ch1 id\u003d\"output\"\u003eOutput\u003c/h1\u003e\n\u003cp\u003ePrint the number of beautiful permutations of \u003cspan class\u003d\"math inline\"\u003e$ 1,2,\\ldots,n $\u003c/span\u003e modulo \u003cspan class\u003d\"math inline\"\u003e$ 10^9+7 $\u003c/span\u003e.\u003c/p\u003e\n\u003ch1 id\u003d\"constraints\"\u003eConstraints\u003c/h1\u003e\n\u003cul\u003e\n\u003cli\u003e\u003cspan class\u003d\"math inline\"\u003e$ 1 \\le n \\le 1000 $\u003c/span\u003e\u003c/li\u003e\n\u003c/ul\u003e\n\u003ch1 id\u003d\"example\"\u003eExample\u003c/h1\u003e\n\u003ctable class\u003d\"vjudge_sample\"\u003e\n\u003cthead\u003e\n \u003ctr\u003e\n \u003cth\u003eInput\u003c/th\u003e\n \u003cth\u003eOutput\u003c/th\u003e\n \u003c/tr\u003e\n\u003c/thead\u003e\n\u003ctbody\u003e\n \u003ctr\u003e\n \u003ctd\u003e\u003cpre\u003e5\n\u003c/pre\u003e\u003c/td\u003e\n \u003ctd\u003e\u003cpre\u003e14\n\u003c/pre\u003e\u003c/td\u003e\n \u003c/tr\u003e\n\u003c/tbody\u003e\n\u003c/table\u003e\n\u003c/div\u003e "}}]}