Best Coder ^beta
VIP | STD Contests
DIY | Web-DIY ^beta

Renovation Problem

Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)
Total Submission(s): 847 Accepted Submission(s): 301

Problem Description

The New Year’s Day is comming ! Every family want to make theiir house looks more beautiful , so does Teddy’s . To make his own house looks different from other's , he went to the shop to buy four kinds of tiles . each kind of tiles has different size : 1*1 , 2*2 , 3*3 and 4 * 4, respectively .

The problem is , how many ways there are to tile his floor which has a area of 4*N using these four kinds of tiles ? You can assume that the number of each kind of tiles is enough.

Input

The first line contain a T. followed by T lines ,each line contain a integer N.(1<=N <=100).

Output

For each case, output the ans % 19890907.

Sample Input

2
1
2

Sample Output

1
5

Author

Teddy

Source

HDU 1st “Vegetable-Birds Cup” Programming Open Contest

Statistic | Submit | Discuss | Note

Home | Top

Hangzhou Dianzi University Online Judge 3.0
Copyright © 2005-2024 HDU ACM Team. All Rights Reserved.
Designer & Developer : Wang Rongtao LinLe GaoJie GanLu
Total 0.000000(s) query 1, Server time : 2024-04-19 23:37:05, Gzip enabled

Administration