Go: package main

import (
	"fmt"
	"strconv"
)

func main() {
	for _, leftValue := range MultiplicationTableNum(9) {
		for _, rightValue := range MultiplicationTableNum(9) {
			strLeftVal, strRightVal, strMulti := strconv.Itoa(leftValue), strconv.Itoa(rightValue), strconv.Itoa(Multiplication(leftValue, rightValue))
			fmt.Println(strLeftVal + "x" + strRightVal + "=" + strMulti)
		}
	}
}

func MultiplicationTableNum(num int) []int {
	multiNum := []int{}
	for i := 1; i <= num; i++ {
		multiNum = append(multiNum, i)
	}
	return multiNum
}

func Multiplication(x, y int) int {
	return x * y
}

C++: #include <iostream>
#include <cstdio>
#include <vector>
#include <string>
#include <array>
#include <queue>
#include <deque>
#include <set>
#include <list>
#include <map>
#include <stack>
#include <utility>
#include <algorithm>
#include <numeric>
#include <cstdio>
#include <cstdlib>
#include <cmath>
#include <cctype>
#include <cstring>
#include <climits>
#include <bitset>
#include <random>
#include <functional>
#include <sstream>
#include <iomanip>

using namespace std;

#define _CRT_SECURE_NO_WARNINGS
#define rep(i, n) for(int i=0; i<(n); i++)
#define FOR(i, m, n) for(int i=(m);i<(n);i++)
#define SZ(x) ((int)(x).size())
#define all(x) (x).begin(),(x).end()
#define SORT(x) sort((x).begin(),(x).end())
#define REVE(x) reverse((x).begin(),(x).end())
#define mp make_pair
#define pb push_back

typedef vector<int> VI;
typedef vector<string> VS;
typedef vector<vector<int>> VVI;
typedef pair<int, int> PII;
typedef long long LL;

int main() {
	FOR(i, 1, 10) {
		FOR(j, 1, 10) {
			printf("%dx%d=%d\n", i, j, i*j);
		}
	}
}

C++: #include<iostream>
using namespace std;

int main()
{
    for(int i=1;i<=9;i++){
        for(int j=1;j<=9;j++) cout << i << 'x' << j << '=' << i*j << endl;
    }
    return 0;
}

C++: //QQ
class Main{
    public static void main(String[] a){
        int i = 1;
        int j = 1;
        for(;i<10;i++) {
            for(j=1;j<10;j++) {
                System.out.println(i+"x"+j+"="+(i*j));
            }
        }
    }
}

C++: #include <iostream>
using namespace std;

int main() {
  for (int i=1; i<10; i++) {
    for (int j=1; j<10; j++) {
      cout << i << 'x' << j << '=' << i*j << endl;
    }
  }
  return 0;
}

C++: #include<iostream>
using namespace std;
int main(){
  for(int i=1;i<=9;i++){
    for(int j=1;j<=9;j++){
      cout<<i<<'x'<<j<<'='<<i*j<<endl;
    }
  }
  return(0);
}

C++: i;main(){for(;++i<=9;)printf("%dx%d=%d\n",i,10-i,i*10-i);exit(0);}

C++: //AOJ 0000
//include
#include<cstdio>
#include<cctype>
#include<cstring>
#include<cstdlib>
#include<algorithm>
#include<stack>
#include<queue>
#include<deque>
#include<vector>
#include<list>
#include<bitset>
#include<set>
#include<iostream>

//using namespace
using namespace std;

//define

//variable
short a, b;

//function
int main(){
  for(a = 1; a <= 9; a++)
    for(b = 1; b <= 9; b++)
      printf("%dx%d=%d\n", a, b, a * b);
  return 0;
}

C++: ??¨??????

C++: #include <iostream>
#include <cstdio>
 
using namespace std;
 
int main()
{
  for(int i=1;i<=9;i++){
    for(int j=1;j<=9;j++){
      printf("%dx%d=%d\n",i,j,i*j);
    }
  }
  return 0;
}

C++: #include<iostream>
using namespace std;

int main(void){
        for(int a=1;a<=9;a++){
                for(int b=1;b<=9;b++){
                        cout<<a<<"x"<<b<<"="<<a*b<<endl;
                }
        }
        return 0;
}

C++: #include <stdio.h>

int main(void)
{
for (int i = 1; i <= 9; i++){
for (int j = 1; j <= 9; j++){
printf("%dx%d=%d", i, j, i * j);
}
}

return (0);
}

C++: #include <iostream>
using namespace std;

int main() {
	for (int i = 1; i < 10;i++) {
		for (int j = 1; j < 10;j++) {
			cout << i << "x" << j << "=" << i*j << endl;
		}
	}
	return 0;
}

C++: ergergergsegserge

C++: #include <stdio.h>

int main(void){
	for(int i=1;i<=9;++i){
		for(int j=1;j<=9;++j){
			printf("%dx%d=%d\n", i, j, i*j);
		}
	}
	return 0;
}

C++: #include <iostream>

auto main() -> int {
    for (int x = 1; x <= 9; x++) {
        for (int y = 1; y <= 9; y++) {
            std::cout << x << "x" << y << "=" << (x*y) << std::endl;
        }
    }
    return 0;
}

C++: #include <iostream>
#include <conio.h>
 using namespace std;
int main()
{
 
    for(int i=1; i<=9; i++)
	{
        for(int x=1; x<=9; x++)
		{
            cout<<i*x<<endl;
		}
	}
	cin.get();
	getch();
    return 0;
}

C++: #include<iostream>
using namespace std;

int main(void){
	for(int i=1;i<10;i++)
		for(int j=1;j<10;j++)
			cout<<i<<"x"<<j<<"="<<i*j<<endl;

}

C++: #include<stdio.h>

int main(){
	while(true);
	return 0;
}

C++: #include <cstdio>
#include <ctime>
#include <cstdlib>
#include <cstring>
#include <queue>
#include <string>
#include <set>
#include <stack>
#include <map>
#include <cmath>
#include <vector>
#include <iostream>
#include <algorithm>
using namespace std;

#define FF(i, a, b) for(int i = (a); i < (b); ++i)
#define FD(i, b, a) for(int i = (b) - 1; i >= (a); --i)
#define FE(i, a, b) for(int i = (a); i <= (b); ++i)
#define FED(i, b, a) for(int i = (b); i>= (a); --i)
#define REP(i, N) for(int i = 0; i < (N); ++i)
#define CLR(A,value) memset(A,value,sizeof(A))
#define FC(it, c) for(__typeof((c).begin()) it = (c).begin(); it != (c).end(); it++)

#define SZ(V) (int)V.size()
#define PB push_back
#define EQ(a, b) (fabs((a) - (b)) <= EPS)

//INPUT
#define RI(n) scanf("%d", &n)
#define RII(n, m) scanf("%d%d", &n, &m)
#define RIII(n, m, k) scanf("%d%d%d", &n, &m, &k)
#define RIV(n, m, k, p) scanf("%d%d%d%d", &n, &m, &k, &p)
#define RV(n, m, k, p, q) scanf("%d%d%d%d%d", &n, &m, &k, &p, &q)
#define RS(s) scanf("%s", s)

typedef long long LL;
typedef unsigned long long ULL;
typedef vector <int> VI;
const int INF = 1000000000;

int n, visit[2][1100];
LL ans;

void dfs(int x, int y, int cnt)
{
    if (cnt == n)
    {
        ans++;
        //cout << x <<y <<endl;
        ans %= 1000000007;
        return;
    }
    if (x == 0 && !visit[1][y])
    {
        visit[1][y] = 1;
        dfs(1, y, cnt + 1);
        visit[1][y] = 0;
    }
    if (x == 1 && !visit[0][y])
    {
        visit[0][y] = 1;
        dfs(0, y, cnt + 1);
        visit[0][y] = 0;
    }
    if (y > 1 && !visit[x][y - 1])
    {
        visit[x][y - 1] = 1;
        dfs(x, y - 1, cnt + 1);
        visit[x][y - 1] = 0;
    }
    if (y < n && !visit[x][y + 1])
    {
        visit[x][y + 1] = 1;
        dfs(x, y + 1, cnt + 1);
        visit[x][y + 1] = 0;
    }
    if (x == 0 && y > 1 && !visit[1][y - 1])
    {
        visit[1][y - 1] = 1;
        dfs(1, y - 1, cnt + 1);
        visit[1][y - 1] = 0;
    }
    if (x == 0 && y < n && !visit[1][y + 1])
    {
        visit[1][y + 1] = 1;
        dfs(1, y + 1, cnt + 1);
        visit[1][y + 1] = 0;
    }
    if (x == 1 && y < n && !visit[0][y + 1])
    {
        visit[0][y + 1] = 1;
        dfs(0, y + 1, cnt + 1);
        visit[0][y + 1] = 0;
    }
    if (x == 1 && y > 1 && !visit[0][y - 1])
    {
        visit[0][y - 1] = 1;
        dfs(0, y - 1, cnt + 1);
        visit[0][y - 1] = 0;
    }
}

int main()
{
    while (cin >> n)
    {
        int m = n, mid = 0;
        LL res = 0;
        if (n % 2)
            mid = (n + 1) / 2;
        m = --m / 2 + 1;
        FE(i, 1, n)
        {
            CLR(visit, 0);
            ans = 0;
            dfs(0, i, 1);
            res += ans;
//            cout << ans << ' ';
//            if (n % 2 && i == mid)
//                res += (2 * ans) % 1000000007;
//            else
//                res += (4 * ans) % 1000000007;
        }
        cout << res * 2<< endl;
    }
}

C++: #include <cstdlib>
using namespace std;

int main(){
	int k = strtol("1000000000000", 0, 10);
	return k > 0;
}

C++: #include<stdio.h>
int main(void){
	int a, b, c;
	for(a=1;a<10;a++);{
	for(b=1;b<10;b++);{
		c = a * b;
		printf("%dx%d=%d\n", a, b, c);
	}
	}
	return 0;
}