解方程

 

#include<iostream>
#include<cstdio>
#include<cstring>
#include<cmath>
#include<algorithm>
using namespace std;
#define ll long long
#define mod 1000000007
int t;

int main(){
    scanf("%d",&t);
    while(t--){
        int n;
        scanf("%d",&n);
        int p=sqrt(n);
        if(n%4){
            printf("0 0\n");
            continue;
        }
        if(p*p==n){
            printf("infty\n");
            continue;
        }
        ll q=(ll)n/4;
        int cnt=0;
        ll ans=0;
        for( int i=1; (ll)i*i<=q; i++ ) if(q%i==0){
            cnt++;
            ans=(ans+(ll)q*(i+(q/i)))%mod;

        }
        printf("%d %lld\n",cnt,ans);
    }

    return 0;
}