#include <fstream>
#include <iostream>
#include <vector>
#include <algorithm>
using namespace std;
class s {
public:
	int start, end;
};

bool comp(s s1, s s2)
{
	return s1.end - s1.start < s2.end - s2.start;
}
int main()
{
	ifstream fin("consecutive.in");
	ofstream fout("consecutive.out");
	int n, x,i;
	s S;
	vector<s> v;
	fin >> n;
	for (i = 0; i < n; i++)
	{
		fin >> x;
		int a =1, b = (-1+sqrt(1+8*x))/2;
		int suma = (b * (b + 1)) / 2;
		while (b <= (x+1) / 2)
		{
			if (suma < x)
			{
				b++;
				suma = suma + b;
			}
			else if (suma == x)
			{
				//fout << a << " " << b << endl;
				S.start = a;
				S.end = b;
				v.push_back(S);
				suma = suma - a;
				a++;
			}
			else
			{
				suma = suma - a;
				a++;
			}
			
		}
	}
	sort(v.begin(), v.end(), comp);
	fout << v.size()<<endl;
	for (i = 0; i < v.size(); i++)
	{
		fout << v[i].start << " " << v[i].end << endl;
	}
}