====== 2 x n 타일링 ======

===== 풀이 =====
  * BOJ의 [[ps:problems:boj:11726]]과 동일한 문제. 풀이는 그쪽 참고.

===== 코드 =====
<dkpr py>
"""Solution code for "Programmers 12900. 2 x n 타일링".

- Problem link: https://programmers.co.kr/learn/courses/30/lessons/12900
- Solution link: http://www.teferi.net/ps/problems/programmers/12900
"""

from teflib import combinatorics

MOD = 1_000_000_007


def solution(n):
    return combinatorics.fibonacci(n + 1, MOD)
</dkpr>
  * Dependency: [[:ps:teflib:combinatorics#fibonacci|teflib.combinatorics.fibonacci]]

{{tag>프로그래머스 ps:problems:programmers:Level_3}}