#include <iostream>
#include <bits/stdc++.h>
using namespace std;

string s[100];
long long n;
string k;
void dfs(int cnt) {
	if (cnt == n) {
		for (int i = 1; i <= 9; i++) 
		{
			if (i >= 5 && i <= 8) cout << "    ";
			cout << s[i] << endl;	
		}
		return ;
	}
	string tmp[100];
	tmp[1] = "#include <iostream>";
	tmp[2] = "using namespace std;";
	tmp[3] = "";
	tmp[4] = "int main() {";
	tmp[8] = "return 0;";
	tmp[9] = "}";
	tmp[5] = ("cout << \"" + s[1] + "\" << endl;");
	tmp[6] = ("cout << \"" + s[2] + "\" << endl;");
	if (cnt == 2) tmp[7] = ("cout << \"" + s[4] + " " + s[5] + " " + s[6] + " " + s[7] + "\" << endl;");
	else tmp[7] = ("cout << \"" + s[4] + " " + s[5] + " " + s[6] + " " + s[7] + " " + s[8] + " " + s[9] + "\" << endl;");
	for (int i = 1; i <= 10; i++) s[i] = tmp[i];
	dfs(cnt + 1);
}

int main() {
	cin >> n >> k;
	if (n == 1) return cout << k, 0;
	s[1] = "#include <iostream>";
	s[2] = "using namespace std;";
	s[3] = "";
	s[4] = "int main() {";
	s[6] = "return 0;";
	s[7] = "}";
	s[5] = ("cout << \"" + k + "\" << endl;");
	if (n == 2) {
		for (int i = 1; i <= 7; i++) {
			if (i == 5 || i == 6) cout << "    ";
			cout << s[i] << endl;
		}
		return 0;
	}
	dfs(2);
	return 0;
}