#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
int main()
{
ll ans,n,a,b,t1,t2,t3;
cin>>n>>a>>b;
ans=0;
t1=n/a*__gcd(a,b)/b; //相遇次数
t2=min(a,b)-1; //相遇后贡献的次数
ans+=t1+t1*t2;
if(n>=t1*a/__gcd(a,b)*b+t2) ans+=t2;
else ans+=n-t1*a/__gcd(a,b)*b;
t3=__gcd(n,ans);
cout<<ans/t3<<"/"<<n/t3<<endl;
return 0;
}