Counting Grids

CSESMathematicsOpen on judge ↗

Your task is to count the number of different n \times n grids whose each square is black or white. Two grids are considered to be different if it is not possible to rotate one of them so that they look the same. Input The only input line has an integer n: the size of the grid. Output Print one integer: the number of grids modulo 10^9+7. Constraints - 1 \le n \le 10^9 Example Input: 4 O

HINT LADDERno hints yet

L1 Observation

L2 Technique

L3 Approach

L4 Pseudo-code

🔒

L5 Full solution

L5 unlocks only if you insist twice

solution.cppC++17

CodeSearch Tutor

Hints, not spoilers — it won’t hand over the full solution unless you insist.

voice by Sarvam AI