//pure shit
//maybe not :P
#include <iostream>
#include <climits>
#include <algorithm>
using namespace std;
/*int main() {
	setlocale(LC_ALL, "rus");
	int n, nc, y;
	cin >> nc;
	int **ar = new int*[nc*2], *x = new int[nc];
	for (int i = 0; i < nc; ++i) {
		ar[i] = new int[nc];
		for (int j = 0; j < nc; ++j)
			cin >> ar[i][j];
	}
	for (int i = 0; i < nc; ++i) cin >> x[i];
	cin >> y;
	n = nc;
	for (int i = 0; i < n; ++i) {
		for (int j = 0; j < nc; ++j) {
			if (ar[i][j]%y == 0) {
				for (int k = n + 1; k >= i; k--) ar[k] = ar[k - 1];
				ar[i] = x;
				i++, n++;
				break;
			}
		}
	}
	for (int i = 0; i < n; ++i) {
		for (int j = 0; j < nc; ++j)
			cout << ar[i][j] << " ";
		cout << "\n";
	}
	system("pause");
}*/
/*int main() {
	setlocale(LC_ALL, "rus");
	int n, nc, y;
	cin >> nc;
	int **ar = new int*[nc];
	for (int i = 0; i < nc; ++i) {
		ar[i] = new int[nc*2];
		for (int j = 0; j < nc; ++j)
			cin >> ar[i][j];
	}
	n = nc;
	for (int i = 0; i < n; ++i) {
		bool add = 1;
		for (int j = 0; j < nc; ++j)
			if (ar[j][i] % 2) { add = 0; break; }
		if (add) {
			for (int k = 0; k < nc; ++k)
				for (int j = n; j > i; --j)
					ar[k][j] = ar[k][j-1];
			for (int k = 0; k < nc; ++k)
				ar[k][i+1] = ar[k][i];
			i++, n++;
		}
	}
	for (int i = 0; i < nc; ++i) {
		for (int j = 0; j < n; ++j)
			cout << ar[i][j] << " ";
		cout << "\n";
	}
	system("pause");
}*/
/*int main() {
	setlocale(LC_ALL, "rus");
	int n, nc, y, mn = INT_MAX;
	cin >> nc;
	int **ar = new int*[nc];
	for (int i = 0; i < nc; ++i) {
		ar[i] = new int[nc];
		for (int j = 0; j < nc; ++j) {
			cin >> ar[i][j];
			mn = min(mn, ar[i][j]);
		}
	}
	n = nc;
	for (int i = 0; i < n; ++i) {
		bool del = 0;
		for (int j = 0; j < nc; ++j)
			if (ar[i][j] == mn) { del = 1; break; }
		if (del) {
			for (int j = i; j < n - 1; ++j)
				ar[j] = ar[j+1];
			n--; i--;
		}
	}
	cout << "Printing\n";
	for (int i = 0; i < n; ++i) {
		for (int j = 0; j < nc; ++j)
			cout << ar[i][j] << " ";
		cout << "\n";
	}
	system("pause");
}*/
/*int main() {
	setlocale(LC_ALL, "rus");
	int n, nc, y, mx = INT_MIN;
	cin >> nc;
	int **ar = new int*[nc];
	for (int i = 0; i < nc; ++i) {
		ar[i] = new int[nc];
		for (int j = 0; j < nc; ++j) {
			cin >> ar[i][j];
			mx = max(mx, ar[i][j]);
		}
	}
	n = nc;
	for (int i = 0; i < n; ++i) {
		bool del = 0;
		for (int j = 0; j < nc; ++j)
			if (ar[j][i] == mx) { del = 1; break; }
		if (del) {
			for (int k = 0; k < nc; ++k)
				for (int j = i; j < n - 1; ++j)
					ar[k][j] = ar[k][j + 1];
			n--; i--;
		}
	}
	cout << "Printing\n";
	for (int i = 0; i < nc; ++i) {
		for (int j = 0; j < n; ++j)
			cout << ar[i][j] << " ";
		cout << "\n";
	}
	system("pause");
}*/