#include <iostream>
#include <queue>
#include <string.h>

using namespace std;

long long Z = 0;
long long V = 0;

#define MAX 5001
long long a[MAX];
long long u = 1;

struct Node {
	Node(long long k, long long n) : z(++Z), k(k), n(n), v(k==2 ? ++V : -1) {
		if (this->v>0 && this->n<MAX) {
			a[this->n] = this->v;

			while (u<MAX && a[u]) {
				cout << u << ' ' << a[u] << endl;
				u++;
			}
		}
	}

	const long long z;	// node index (breadth first order)
	const long long k;	// number of children (related to A111081)
	const long long n;	// index after removing non branching nodes
	const long long v;	// value (when k = 2)

	// each node has k children
	// is z is odd (resp. even) then children have k = 2 (resp. k = 1)
	void Expand(queue<Node*> &children) {
		for (int c=0; c<this->k; c++) {
			children.push(new Node(this->z%2 ? 2 : 1, k==1 ? this->n : (2*this->n+c))); 
		}
	}
};

int main() {
	memset(a, 0, sizeof(a));

	queue<Node*> nodes;
	nodes.push(new Node(1, 1));

	while (u<MAX) {
		Node *top = nodes.front();
		nodes.pop();
		top->Expand(nodes);
		delete top;
	}

	return 0;
}