#include using namespace std; #define int long long #define stoi stoll using pii=pair; using vi = vector; using vvi = vector; #define all(c) begin(c),end(c) #define rall(c) rbegin(c),rend(c) #define fore(x,c) for(auto &&x:c) #define rep(i,a,n) for(int i=a,i##len=(int)(n);i=a;--i) #define sz(c) ((int)c.size()) #define contains(c,x) (c.find(x)!=end(c)) #define inseg(l,x,r) ((l)<=(x)&&(x)<(r)) #define dump(...) #define pb push_back #define _ 0 const signed INF_=1001001001; const long long INF=1001001001001001001LL; const int DX[9]={0,1,0,-1,1,1,-1,-1,0},DY[9]={-1,0,1,0,-1,1,1,-1,0}; template ostream& operator<<(ostream &os,const vector &v) { for (auto i = begin(v); i != end(v); i++) os<<*i<<(i==end(v)-1?"":" ");return os;} template istream& operator>>(istream &is,vector &v) { for (auto i = begin(v); i != end(v); i++) is>>*i;return is;} template istream& operator>>(istream &is, pair &p) { is>>p.first>>p.second;return is;} template bool chmax(T &a,const U &b){return a bool chmin(T &a,const U &b){return a>b?a=b,1:0;} template void psum(T& c) {partial_sum(begin(c), end(c), begin(c));} template using heap=priority_queue,greater>; struct before_main_function { before_main_function() { cin.tie(nullptr); ios::sync_with_stdio(0); cout << setprecision(15) << fixed; // #define endl "\n" } } before_main_function; //------------------8<------------------------------------8<-------------------- void dump_impl(string s) { assert(s.empty()); } template void dump_impl(string s, const H &head, const T&... tail) { int par = 0; rep(i, 0, sz(s)) { char ch = s[i]; if (ch == ',' && par == 0) { cerr << " = " << head << ", "; dump_impl(s.substr(i + 1), tail...); return; } else { cerr << ch; if (ch == '(') par++; if (ch == ')') par--; } } } #ifdef dump #undef dump #endif #define dump(...) do { cerr << "\x1b[33;1m"; dump_impl(#__VA_ARGS__ ",", __VA_ARGS__); cerr << "\x1b[0m" << endl; } while (0) int gcd(int a, int b) { return a ? gcd(b % a, a) : b; } int lcm(int a, int b) { return a / gcd(a, b) * b; } signed main() { int T, A, B; cin >> T >> A >> B; int x = (T - 1) / A + 1; int y = (T - 1) / B + 1; int z = (T - 1) / lcm(A, B) + 1; cout << x + y - z << endl; return 0; }