SP7685 FLWRS - Flowers

Hanadi has **N** flower pots each with a unique flower. The pots are arranged along in a line. One day, She decided to change their order under the condition that no two pots that were originally next to each other remain next to each other. ### Task write a program that is given the number of pots, calculates the number of possible orders satisfying the condition **modulo a given integer M**. ### Constraints **1** N 2,000 The number of pots. **2** M 1,000,000,000

- Line 1 contains the integer **N**, the number of flower pots. - Line 2 contains the integer **M**.

A single line containing one integer between 0 and **M-1** (inclusive): the number of possible orders modulo **M**.