#include<iostream>
#include<cstdio>
#include<algorithm>
using namespace std;
int sum[10000001];
void qz(){
	for(int i=1;i<=10000000;i++){
		sum[i]=sum[i-1]+i;
	}
}
int main(){
	qz();
	int n;
	cin>>n;
	int ceng=0;
	for(int i=1;i<=10000000;i++){
		if(n-sum[i]<=0){
			ceng=i;
			break;
		}
	}
	//cout<<ceng<<endl;
	int first,second,yyw;
//	yyw=n-sum[ceng-1];
//	first=yyw;
//	second=ceng-yyw-1;
    if(ceng%2){
	    second=n-sum[ceng-1];
    	first=ceng-second+1;
	}else{
		first=n-sum[ceng-1];
		second=ceng-first+1;
	}
	cout<<first<<"/"<<second<<endl;
	return 0;
}