#include <bits/stdc++.h>
using namespace std;
/*#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
using namespace __gnu_pbds;
template<typename T> using gpp_set = tree<T, null_type, less<T>, rb_tree_tag, tree_order_statistics_node_update>;
template<typename T, typename L> using gpp_map = tree<T, L, less<T>, rb_tree_tag, tree_order_statistics_node_update>;
template<typename T> using gpp_multiset = tree<T, null_type, less_equal<T>, rb_tree_tag, tree_order_statistics_node_update>;*/
struct fast_ios { fast_ios(){ cin.tie(0); ios::sync_with_stdio(false); cout << fixed << setprecision(20); }; } fast_ios_;
#define FOR(i, begin, end) for(int i=(begin);i<(end);i++)
#define REP(i, n) FOR(i,0,n)
#define IFOR(i, begin, end) for(int i=(end)-1;i>=(begin);i--)
#define IREP(i, n) IFOR(i,0,n)
#define Sort(v) sort(v.begin(), v.end())
#define Reverse(v) reverse(v.begin(), v.end())
#define all(v) v.begin(),v.end()
#define SZ(v) ((int)v.size())
#define Lower_bound(v, x) distance(v.begin(), lower_bound(v.begin(), v.end(), x))
#define Upper_bound(v, x) distance(v.begin(), upper_bound(v.begin(), v.end(), x))
#define Max(a, b) a = max(a, b)
#define Min(a, b) a = min(a, b)
#define bit(n) (1LL<<(n))
#define bit_exist(x, n) ((x >> n) & 1)
#define debug(x) cout << #x << "=" << x << endl;
#define vdebug(v) cout << #v << "=" << endl; REP(i_debug, v.size()){ cout << v[i_debug] << ","; } cout << endl;
#define mdebug(m) cout << #m << "=" << endl; REP(i_debug, m.size()){ REP(j_debug, m[i_debug].size()){ cout << m[i_debug][j_debug] << ","; } cout << endl;}
#define Return(ans) { cout << (ans) << endl; return 0; }
#define pb push_back
#define f first
#define s second
#define int long long
#define INF 1000000000000000000
template<typename T> istream &operator>>(istream &is, vector<T> &v){ for (auto &x : v) is >> x; return is; }
template<typename T> ostream &operator<<(ostream &os, vector<T> &v){ for(int i = 0; i < v.size(); i++) { cout << v[i]; if(i != v.size() - 1) cout << endl; }; return os; }
template<typename T1, typename T2> ostream &operator<<(ostream &os, pair<T1, T2> p){ cout << '(' << p.first << ',' << p.second << ')'; return os; }
template<typename T> void Out(T x) { cout << x << endl; }
template<typename T1, typename T2> void Ans(bool f, T1 y, T2 n) { if(f) Out(y); else Out(n); }

using vec = vector<int>;
using mat = vector<vec>;
using Pii = pair<int, int>;
using PiP = pair<int, Pii>;
using PPi = pair<Pii, int>;
using bools = vector<bool>;
using pairs = vector<Pii>;

//int dx[4] = {1,0,-1,0};
//int dy[4] = {0,1,0,-1};
//char d[4] = {'D','R','U','L'};

const int mod = 1000000007;
//const int mod = 998244353;
//#define Add(x, y) x = (x + (y)) % mod
//#define Mult(x, y) x = (x * (y)) % mod



signed main(){

    int N, X, D; cin >> N >> X >> D;

    if(D == 0){
        if(X != 0){
            Return(N + 1);
        }
        else{
            Return(1);
        }
    }else if(D < 0){
        X *= -1;
        D *= -1;
    }

    int k0 = INF, n;
    FOR(k, 1, N + 1) if((X * k) % D == 0){
        k0 = k;
        n = (X * k) / D;
        break;
    }
    //debug(k0); debug(n);

    vec a(N + 1), b(N + 1);
    a[0] = b[0] = 0;
    REP(i, N){
        a[i + 1] = a[i] + i;
        b[i + 1] = b[i] + N - 1 - i;
    }

    int ans = 0;
    if(k0 == INF){
        REP(i, N + 1) ans += b[i] - a[i] + 1;
    }else{
        REP(k, k0){
            pairs p;
            int t = 0;
            for(int i = k; i <= N; i += k0){
                p.pb(Pii(a[i] + t, b[i] + t)); 
                t += n;
            }
            if(SZ(p) == 0) continue;
            Sort(p);
            int tmp = p[0].s - p[0].f + 1;
            int M = p[0].s + 1;
            FOR(i, 1, SZ(p)){
                Max(M, p[i].f);
                if(p[i].s >= M){
                    tmp += p[i].s - M + 1;
                }
                Max(M, p[i].s + 1);
            }
            ans += tmp;
            //debug(k); vdebug(p); debug(tmp);
        }

    }

    Out(ans);

    return 0;
}


Measured memory_bytes: 9456