#include<iostream>
#include<string>
#include<algorithm>
#include<vector>
#include<iomanip>
#include<math.h>
#include<complex>
#include<queue>
#include<deque>
#include<stack>
#include<map>
#include<set>
#include<bitset>
#include<functional>
#include<assert.h>
#include<numeric>
using namespace std;
#define REP(i,m,n) for(int i=(int)(m) ; i < (int) (n) ; ++i )
#define rep(i,n) REP(i,0,n)
using ll = long long;
const int inf=1e9+7;
const ll longinf=1LL<<60 ;
const ll mod=1e9+7 ;

ll gcd(ll x,ll y){
    return  y?gcd(y,x%y):x;
}
ll lcm(ll x,ll y){
    if((double)x*y/gcd(x,y)>2e18)return 1ll<<60;
    return x/gcd(x,y)*y;
}
int main(){
    ll a,b,t;
    cin>>t>>a>>b;
    ll l = lcm(a,b);
    cout<<(t+a-1)/a+(t+b-1)/b-(t+l-1)/l<<endl;
    return 0;
}