#include <iostream> using namespace std; int jc(int n) { //递归出口 if (n == 0 || n == 1) { return 1; } //n的阶乘=n*(n-1的阶乘) return n * jc(n-1); } int gcd(int a,int b) { if (a%b == 0) { return b; } return gcd(b,a%b); } long long x_n(int x,int n) { if ( n == 0) { return 1; } if (x == 0) { return 0; } if (n == 1) { return x; } return x * x_n(x,n-1); } void OJ1490_baoli(int k) { for (int i = 1;i <= 2*k;i++) { for (int j = 0;j <= k*(k+1);j++) { if (i <= j) { if (k*(i+j) == i*j) { cout<<"1/"<<k<<" = "<<"1/"<<i<<" + "<<"1/"<<j<<endl;; } } } } } void OJ1490(int k) { for (int x = k+1;x <= 2*k;x++) { int a = k*x; int b = x-k; if (a % b == 0) { cout<<"1/"<<k<<" = "<<"1/"<<x<<" + "<<"1/"<<a/b<<endl;; } } } int main() { int k; cin>>k; OJ1490(k); return 0; }