#include <iostream>
#include <string.h>
#include <vector>
using namespace std;

#define MAX (1LL<<32)

long long get(long long i);
long long compute(long long i) {
	// positive Fibonacci numbers
	if (i==0) {
		return 1;
	} else if (i==1) {
		return 2;
	} else {
		return get(i-1) + get(i-2);
	}
}

vector<long long> f;
long long get(long long i) {
	while (i>=f.size()) {
		f.push_back(compute(f.size()));
	}
	return f[i]; 
}

int main() {
	bool *sums = new bool[MAX];

	memset(sums, 0, MAX*sizeof(*sums));
	sums[0] = true;

	long long total = 0;
	long long limit = 0;
	long long n = 0;

	for (long long v=1;; v++) {
		while (get(limit) < v+total) {
			limit++;
		}

		bool keep = true;

		long long d;
		for (long long t=limit; (d=get(t)-v)>=0; t--) {
			if (d<MAX && sums[d]) {
				keep = false;
				break;
			}
		}

		if (keep) {
			for (long long o=total; o>=0; o--) {
				if (sums[o]) {
					if (o+v>=MAX) {
						long long z=0;
						for (long long n=0; n<v; n++) {
							if (!sums[n]) {
								cout << ++z << ' ' << n << endl;
							}
						}

						delete[] sums;
						return 0;
					}

					sums[o+v] = true;
				}
			}

			total += v;
		}
	}
}