|시간 제한||메모리 제한||제출||정답||맞은 사람||정답 비율|
|0.5 초 (추가 시간 없음)||512 MB||2||2||2||100.000%|
Walter sells balloons from door to door. Every day he chooses a street in his city and visits every house there, offering his colorful balloons.
Each street in the city of Walter has the same number of houses on both sides, and all the houses in the city are the same size. That way, each street can be viewed as a 2 × N matrix, where each cell is a house, and N is the amount of houses along each side of the street.
After choosing the street of the day, Walter visits each house on that street exactly once. He can start his way in any house, but can only move between adjacent houses horizontally, vertically or diagonally.
The table above illustrates an example where N = 6. After visiting house number 1, Walter could only proceed immediately to houses number 2, 7, and 8 (that is, if he has not visited them before). And after visiting house number 11, the next house on the way could only be one of 4, 5, 6, 10, or 12.
Today, before leaving home, Walter looked at the city map to count the number of houses on either side of the chosen street. Now he wants to know how many different ways he can visit all the 2N houses on the street, following the rules outlined. Two ways to visit the houses are different if and only if the order of the houses varies: that is, if there are two houses A and B such that A is visited before B in one order and B is visited before A in the other.
The input consists of a single line, which contains an integer N (1 ≤ N ≤ 109).
Your program must output a single line, containing an integer, representing the number of different ways to visit all houses in the street. Since this number can be very big, print the remainder of dividing it by 109 + 7.