8811: [CSES Problem Set] Permutations II
[Creator : ]
Description
A permutation of integers 1,2,…,n is called beautiful if there are no adjacent elements whose difference is 1.
Given n, your task is to count the number of beautiful permutations.
Given n, your task is to count the number of beautiful permutations.
Input
The only input line contains an integer n.
Output
Print the number of beautiful permutations of 1,2,…,n modulo $10^9+7$.
Constraints
$1 \leq n \leq 1000$
Sample 1 Input
5
Sample 1 Output
14