# include <iostream>
# include <cmath>
using namespace std;
int main()
{
int fenmu, fenzi ,n, m;
cin >> n;
m = sqrt(2*n);
if (m*(m+1) >= 2*n)
-- m;
int num = n - m*(m+1)/2;
m = m+1;
if ( m % 2 ){
fenzi = m+1-num;
fenmu = num;
}
else{
fenzi = num;
fenmu = m+1-num;
}
cout << fenzi << "/" << fenmu << endl;
return 0;
}
// 1+2+3+....m = (1+m)*m/2 = n
//m*(m+1) = 2*n
//找到满足 m*(m+1) < 2*n 的最大m