例题8-2 联合国大楼（Building for UN, ACM/ICPC NEERC 2007, UVa1605）

#include <set>
#include <map>
#include <ctime>
#include <cmath>
#include <stack>
#include <queue>
#include <deque>
#include <cstdio>
#include <string>
#include <vector>
#include <cctype>
#include <sstream>
#include <utility>
#include <cstring>
#include <cstdlib>
#include <iostream>
#include <algorithm>
#define SF(a) scanf("%d", &a)
#define PF(a) printf("%d\n", a)  
#define SFF(a, b) scanf("%d%d", &a, &b)  
#define SFFF(a, b, c) scanf("%d%d%d", &a, &b, &c)
#define CLEAR(a, b) memset(a, b, sizeof(a))
#define IN() freopen("in.txt", "r", stdin)
#define OUT() freopen("out.txt", "w", stdout)
#define FOR(i, a, b) for(int i = a; i < b; ++i)
#define LL long long
#define maxn 105
#define maxm 205
#define mod 1000000007
#define INF 10000007
#define eps 1e-4
using namespace std;
//-------------------------CHC------------------------------//
char alp[55];

int main() {
	int n;
	FOR(i, 0, 26) alp[i] = 'a' + i, alp[26 + i] = 'A' + i;
	while (SF(n) == 1) {
		printf("2 %d %d\n", n, n);
		FOR(i, 0, n) {
			FOR(j, 0, n) putchar(alp[j]);
			puts("");
		}
		puts("");
		FOR(i, 0, n) {
			FOR(j, 0, n) putchar(alp[i]);
			puts("");
		}
		puts("");
	}
	return 0;
}