package main import ( "bufio" "fmt" "os" "strconv" ) func configure(scanner *bufio.Scanner) { scanner.Split(bufio.ScanWords) scanner.Buffer(make([]byte, 1000005), 1000005) } func getNextString(scanner *bufio.Scanner) string { scanned := scanner.Scan() if !scanned { panic("scan failed") } return scanner.Text() } func getNextInt(scanner *bufio.Scanner) int { i, _ := strconv.Atoi(getNextString(scanner)) return i } func getNextInt64(scanner *bufio.Scanner) int64 { i, _ := strconv.ParseInt(getNextString(scanner), 10, 64) return i } func getNextFloat64(scanner *bufio.Scanner) float64 { i, _ := strconv.ParseFloat(getNextString(scanner), 64) return i } func main() { fp := os.Stdin wfp := os.Stdout extra := 0 if os.Getenv("I") == "IronMan" { fp, _ = os.Open(os.Getenv("END_GAME")) extra = 100 } scanner := bufio.NewScanner(fp) configure(scanner) writer := bufio.NewWriter(wfp) defer func() { r := recover() if r != nil { fmt.Fprintln(writer, r) } writer.Flush() }() solve(scanner, writer) for i := 0; i < extra; i++ { fmt.Fprintln(writer, "-----------------------------------") solve(scanner, writer) } } func solve(scanner *bufio.Scanner, writer *bufio.Writer) { q := getNextInt(scanner) var testcase func() testcase = func() { n := getNextInt64(scanner) - 1 v := makeGrid(1, 4) u := makeGrid(4, 4) v[0][3] = 1 u[1][0] = 1 u[2][1] = 1 u[3][2] = 1 u[0][3] = 1 u[1][3] = 1 u[2][3] = 1 u[3][3] = 1 for n > 0 { if n&1 == 1 { v = mul(v, u) } u = mul(u, u) n >>= 1 } fmt.Fprintln(writer, v[0][0]) } for i := 0; i < q; i++ { testcase() } } func mul(v1, v2 [][]mint) [][]mint { h := len(v1) w := len(v2) v := makeGrid(h, w) for i := 0; i < h; i++ { for j := 0; j < w; j++ { for k := 0; k < w; k++ { v[i][j].addAs(v1[i][k].mul(v2[k][j])) } } } return v } func makeGrid(h, w int) [][]mint { index := make([][]mint, h, h) data := make([]mint, h*w, h*w) for i := 0; i < h; i++ { index[i] = data[i*w : (i+1)*w] } return index } type mint int64 func (mt mint) mod() mint { m := mint(17) mt %= m if mt < 0 { return mt + m } return mt } func (mt mint) inv() mint { return mt.pow(mint(0).sub(2)) } func (mt mint) pow(n mint) mint { p := mint(1) for n > 0 { if n&1 == 1 { p.mulAs(mt) } mt.mulAs(mt) n >>= 1 } return p } func (mt mint) add(x mint) mint { return (mt + x).mod() } func (mt mint) sub(x mint) mint { return (mt - x).mod() } func (mt mint) mul(x mint) mint { return (mt * x).mod() } func (mt mint) div(x mint) mint { return mt.mul(x.inv()) } func (mt *mint) addAs(x mint) *mint { *mt = mt.add(x) return mt } func (mt *mint) subAs(x mint) *mint { *mt = mt.sub(x) return mt } func (mt *mint) mulAs(x mint) *mint { *mt = mt.mul(x) return mt } func (mt *mint) divAs(x mint) *mint { *mt = mt.div(x) return mt }