#include <iostream>
#include <iomanip>
#include <cmath>
#include <string>
#include <vector>
#include <algorithm>
#include <utility>

using ::std::cout;
using ::std::cin;
using ::std::string;


double CoutValueOfPolynomial(int n , int* arr, double val);
std::vector<int> FindDividers(int a);


int main() {

    int n;
    cin >> n;
    int* arr = new int[n + 1];
    std::vector<std::pair<int,int>> roots;

    int temp;

    for(int i = 0 ; i < n + 1 ; i++){
        cin >> temp;
        arr[i] = temp;
    }


    int a0 = arr[n]; // wspolczynnik a_0
    int an = arr[0]; // wspolczynik a_n

    // dzielniki a0
    auto a0_dividers = FindDividers(a0);
    // znajduje dzielniki calkowite a0 , ktore sa pierwiastkami
    for(auto divider: a0_dividers){
        if(CoutValueOfPolynomial(n,arr,divider)==0){
            auto p = std::make_pair(divider,1);
            roots.push_back(p);
        }
    }

    auto an_dividers = FindDividers(an);
    double dtemp;

    for(auto an_divider: an_dividers){
        for(auto a0_divider: a0_dividers){
            dtemp = (double)a0_divider / an_divider;
            if(CoutValueOfPolynomial(n,arr,dtemp) == 0){
                auto p = std::make_pair(a0_divider, an_divider);
                roots.push_back(p);
            }
        }
    }





    cout << roots.size() << "\n";
    for(auto val: roots){
        cout << val.first << " " << val.second << "\n";
    }






    delete arr;


    return 0;
}

double CoutValueOfPolynomial(int n , int* arr, double val){
    double result = 0;
    for (int i = 0 ; i < n + 1; i++){
        result += (pow(val, n- i ) * arr[i]);
    }
    return result;
}



std::vector<int> FindDividers(int a){
    std::vector<int> dividers;
    if (a > 0){
        for(int i = 1 ; i <= a ; i++){
            if(a % i == 0){
                dividers.push_back(i);
            }
        }
        for(int i = -1 ; i >= -a ; i--){
            if(a % i == 0){
                dividers.push_back(i);
            }
        }
    } else if (a < 0){
        for(int i = -1 ; i >= a ; i--){
            if(a % i == 0){
                dividers.push_back(i);
            }
        }
        for(int i = 1 ; i <= -a ; i++){
            if(a % i == 0){
                dividers.push_back(i);
            }
        }
    }

    return dividers;
}