{"trustable":false,"sections":[{"title":"Description","value":{"format":"MD","content":"你有一排砖,你想给这一排砖中的每一块涂上红,蓝,绿,黄中4种颜色中的其中1种,也就是说每一块砖只能涂1种颜色.现在一排有N块砖,问你有多少种方案,让红色和绿色的砖的块数为偶数."}},{"title":"Input","value":{"format":"MD","content":"输入:第一行为T,代表数据组数.(1\u003c\u003dT\u003c\u003d100),接下来T行每行包括一个数字N,代表有N(1\u003c\u003dN\u003c\u003d10^9)块砖.\n"}},{"title":"Output","value":{"format":"MD","content":"输出:满足条件的方案数,答案模上10007."}},{"title":"Sample Input","value":{"format":"MD","content":"\u003cpre class\u003d\"sio\"\u003e2\n1\n2\u003c/pre\u003e"}},{"title":"Sample Output","value":{"format":"MD","content":"\u003cpre class\u003d\"sio\"\u003e2\n6\u003c/pre\u003e"}}]}