Problem Description

Given a positive integer $N$, you need to split $N$ into a sum of several positive integers. The numbers used in the addition can be repeated.

Note:

• The order of a partition does not matter.
• You must split it into a sum of at least $2$ numbers.

Output the number of valid partitions $\bmod 2147483648$.

Input Format

A positive integer $N$.

Output Format

Output one integer, representing the result.

7

14

Hint

Constraints: $1 \le N \le 4000$.

Translated by ChatGPT 5