Go: package main
import "fmt"
func main(){
    for i:=1;i<10;i++{
        for j:=1;j<10;j++{
            fmt.Print(i)
            fmt.Print("x")
            fmt.Print(j)
            fmt.Print("=")
            fmt.Println(i*j)
        }
    }
}

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;
}

C++: #include<iostream>
using namespace std;
class solve{ 
    public:
        void qq(){ 
            for(int i=1;i<10;i++){ 
                for(int j=1;j<10;j++){ 
                    cout<<i<<"x"<<j<<"="<<i*j<<endl;
                }
            }
        }
};
int main(){
    solve ans;
    ans.qq();
    return 0;
}

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

int main(){
	cin.tie(0);
	ios::sync_with_stdio(false);

	for (int i = 1; i <= 9; i++){
		cout << i << "x" << i << "=" << i*i << "\n";
	}

	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++: #include <iostream>
#include <string>
#include <algorithm>
#include <cmath>

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++: #include<stdio.h>
int main(){
  int i,j;
  for(i=1;i<=9;i++){
    for(j=1;j<=9;j++){
      printf("%dx%d=%d\n",i,j,i*j);
    }
  }
  return(0);
}

C++: #include <bits/stdc++.h>
using namespace std;
#define FOR(i, s, n) for(int i = s; i < (int)n; i++)
#define per(i, n) for(int i = n; i >= 0; i--)
#define ROF(i, s, n) for(int i = s; i >= (int)n; i--)
#define FORIT(i, A) for (auto i : A)
#define PRINT(x) cout << (x) << "\n"
#define ALL(a) (a).begin(),(a).end()
#define RALL(a) (a).rbegin(), (a).rend()
#define MP make_pair
#define EACH(i, n) for (__typeof((n).begin()) i = (n).begin(); i != (n).end(); ++i)
#define SZ(a) int((a).size())
#define EXIST(s,e) ((s).find(e)!=(s).end())
#define SORT(c) sort((c).begin(),(c).end())
#define CLR(a) memset((a), 0 ,sizeof(a))
#define NCLR(a) memset((a), -1 ,sizeof(a))
#define dump(x) cout << #x << " = " << (x) << "\n";
#define debug(x) cout << #x << " = " << (x) << " (L" << __LINE__ << ")" << " " << __FILE__ << "\n";
#define sq(n) (n) * (n)
typedef vector<int> VI;
typedef vector<VI> VVI;
typedef vector<string> VS;
typedef pair<int, int> PII;
typedef long long LL;
typedef vector<LL> VLL;
typedef vector<VLL> VVLL;
typedef unsigned int uint;
typedef unsigned long long ull;
typedef priority_queue<int> maxpq;
typedef priority_queue< int, vector<int>, greater<int> > minpq;
typedef complex<double> P;
static const double EPS = 1e-10;
static const double PI = acos( -1.0 );
static const int mod = 1000000007;
static const int INF = 1 << 29;
static const LL LL_INF = 1152921504606846976;
static const int dx[] = { -1, 0, 1, 0, 1, -1, 1, -1 };
static const int dy[] = { 0, -1, 0, 1, 1, 1, -1, -1 };


int main() {
#ifdef _DEBUG
	printf( "debug\n" );
#endif
	for ( int i = 1; i < 10; i++ ) {
		for ( int j = 1; j < 10; j++ ) {
			printf( "%dx%d=%d\n", i - i, j, i * j );
		}
	}
	return 0;
}

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

int main() {
  for (int n = 1; n <= 9; ++n) {
    for (int i = 1; i <= 9; ++i) {
      cout << n << "x" << i << "=" << n * i << 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;
}