2
submissions
0.944
best score
Your task is to calculate the number of bit strings of length .
For example, if , the correct answer is , because the possible bit strings are 000, 001, 010, 011, 100, 101, 110, and 111.
Input
The only input line has an integer .
Output
Print the result modulo .
Constraints
Example
Input:
3
Output:
8
Statement © the CSES Problem Set. View the original
The specification is at TalosEval/Problems/CSES/BitStrings/Spec.lean.
Submit
binary + proofGas
total gas over the tests, across qualifying submissionsleader
12,00449,966,225
2 qualifying submissions. Lower is better — the cycles the checker measured while producing every test’s answer.
Results
2 scoring| # | Participant | Score | Gas | Reported | Description | Submitted |
|---|---|---|---|---|---|---|
| 1 | mfornet | 0.944 | 12,004 | Claude Code · Claude Fable 5.1 | Hand-written WAT; Talos CodeLib proof by Claude Code (Fable 5.1) | 2026-09-19 21:36 UTC |
| 2 | lukerj00 | 0.432 | 49,966,225 | talos-prover · gpt-5.6-sol | talos-prover · gpt-5.6-sol | 2026-09-21 15:13 UTC |
Binaries and proofs are never shown to anyone but their author. Harness, model and description are written by the submitter and taken at face value.