//k+1<=y<=2*k
#include <iostream>
#include<cstdio>
using namespace std;
typedef pair<int,int>PII;
const int maxn=200+5;
int main()
{
int k;
while(scanf("%d",&k)==1)
{
PII ss[maxn];
int y;
int kase=0;
for(y=k+1;y<=2*k;y++)
{
if((k*y)%(y-k)==0) {
int t=(k*y)/(y-k);
ss[kase++]=PII(t,y);
}
}
printf("%d\n",kase);
for(int i=0;i<kase;i++)
printf("1/%d = 1/%d + 1/%d\n",k,ss[i].first,ss[i].second);
}
return 0;
}
#include <iostream>
#include<cstdio>
using namespace std;
typedef pair<int,int>PII;
const int maxn=200+5;
int main()
{
int k;
while(scanf("%d",&k)==1)
{
PII ss[maxn];
int y;
int kase=0;
for(y=k+1;y<=2*k;y++)
{
if((k*y)%(y-k)==0) {
int t=(k*y)/(y-k);
ss[kase++]=PII(t,y);
}
}
printf("%d\n",kase);
for(int i=0;i<kase;i++)
printf("1/%d = 1/%d + 1/%d\n",k,ss[i].first,ss[i].second);
}
return 0;
}