1 #include <iostream> 2 #include <cstdio> 3 const int maxn = 1e6+5; 4 typedef long long LL; 5 using namespace std; 6 LL a[maxn],b[maxn]; 7 int main() 8 { 9     LL k;10     while(scanf("%lld",&k) == 1) {11         LL cnt = 0,kk = 2*k,x,y;12         for(LL y = k+1; y <= kk; y++) {13             if(y*k%(y-k))14                 continue;15             LL x = y*k/(y-k);16             if(x >= y) {17                 a[cnt] = x;18                 b[cnt++] = y;19             }20         }21         cout<<cnt<<endl;22         for(int i = 0; i < cnt; i++)23             printf("1/%lld = 1/%lld + 1/%lld\n",k,a[i],b[i]);24     }25     return 0;26 }