{"problem":{"name":"Redistribution","description":{"content":"Given is an integer $S$. Find how many sequences there are whose terms are all integers greater than or equal to $3$, and whose sum is equal to $S$. The answer can be very large, so output it modulo $","description_type":"Markdown"},"platform":"AtCoder","limit":{"time_limit":2000,"memory_limit":262144},"difficulty":"None","is_remote":true,"is_sync":true,"sync_url":null,"sign":"abc178_d"},"statements":[{"statement_type":"Markdown","content":"Given is an integer $S$. Find how many sequences there are whose terms are all integers greater than or equal to $3$, and whose sum is equal to $S$. The answer can be very large, so output it modulo $10^9 + 7$.\n\n## Constraints\n\n*   $1 \\leq S \\leq 2000$\n*   All values in input are integers.\n\n## Input\n\nInput is given from Standard Input in the following format:\n\n$S$\n\n[samples]","is_translate":false,"language":"English"}],"meta":{"iden":"abc178_d","tags":[],"sample_group":[["7","3\n\n$3$ sequences satisfy the condition: ${3,4}$, ${4,3}$ and ${7}$."],["2","0\n\nThere are no sequences that satisfy the condition."],["1729","294867501"]],"created_at":"2026-03-03 11:01:14"}}