#include<iostream>
#include<algorithm>
using namespace std;

long long lcm(long long a, long long b){
    return a*b/(__gcd(a,b));
}
int main()
{
    long long n,x,y;cin>>n>>x>>y;
    long long i,k,sum=0;
    k=lcm(x,y);//k是最小公倍数
    for(i=0;i<(n-1)*x+1;i++)
    {
        if(i*1.0/k==i/k)
        {
            sum=sum+1;
        }
    }
    cout<<sum;
    return 0;
}