#include <iostream>

#include <algorithm>

#include <cstdio>

#include <cstdlib>

#include <cstring>

#include <cmath>

#include <ctime>

#include <vector>

using namespace std;

vector<pair<long long,long long> >S;

int main()

{

    long long    x,i,Ans=;

    scanf("%lld",&x);

    for(i=;;++i)

    {

        long long n=i,m=(6LL*x-n+n*n*n)/(*n*n+*n);

        if(n>m)break;

        if((6LL*x-n+n*n*n)%(*n*n+*n)==)

        {

            S.push_back(make_pair(n,m));

        }

    }

    if(S.back().first==S.back().second)

    {

        Ans=-;

    }

    Ans+=(int)S.size()<<;

    printf("%lld\n",Ans);

    for(i=;i<(int)S.size();++i)

    {

        printf("%lld %lld\n",S[i].first,S[i].second);

    }

    if(S.back().first==S.back().second)

    {

        S.pop_back();

    }

    while(!S.empty())

    {

        printf("%lld %lld\n",S.back().second,S.back().first);

        S.pop_back();

    }

    return ;

}