#include <bits/stdc++.h>
#include <algorithm>
#include <bitset>
#include <complex>
#include <deque>
#include <iostream>
#include <istream>
#include <iterator>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <vector>
#include <tuple>
#include <iomanip>
using namespace std;

typedef long long ll;
typedef unsigned long long ull;
//typedef pair<ll, ll> P;
#define rep(i, n) for(ll i = 0; i < (n); i++)
#define revrep(i, n) for(ll i = (n)-1; i >= 0; i--)
#define pb push_back
#define f first
#define s second
#define chmin(x, y) x = min(x, y);
#define chmax(x, y) x = max(x, y);
/*
ll max(ll a, ll b){return (a > b) ? a : b;}
ll min(ll a, ll b){return (a < b) ? a : b;}
ll max3(ll a, ll b, ll c){return max(a, max(b, c));};
ll min3(ll a, ll b, ll c){return min(a, min(b, c));};
ll max4(ll a, ll b, ll c, ll d){return max(max(a, b), min(c, d));};
ll min4(ll a, ll b, ll c, ll d){return min(min(a, b), min(c, d));};
ll max5(ll a, ll b, ll c, ll d, ll e){return max(max(a, b), max3(c, d, e));};
ll min5(ll a, ll b, ll c, ll d, ll e){return min(min(a, b), min3(c, d, e));};
*/
const ll INFL = LLONG_MAX;//10^18 = 2^60
//const int INF = 1 << 30;//10^9
const ll INF = INFL;
//ll MOD = 1000000007;
ll MOD = 998244353;

vector<ll> dy = {0, -1, 0, 1, 1, 1, -1, -1, 0};
vector<ll> dx = {1, 0, -1, 0, 1, -1, 1, -1, 0};

void pres(double A, ll x = 10){cout << fixed << setprecision(x) << A << endl;}
//デバッグ
void BinarySay(ll x, ll y = 60){rep(i, y) cout << (x>>(y-1-i) & 1); cout << endl;}
ll get_bit(ll x){return __builtin_popcountll(x);}

ll pow_long(ll x, ll k){
  ll res = 1;
  while(k > 0){
    if(k % 2) res *= x;
    x *= x;
    k /= 2;
  }
  return res;
}

ll pow_mod(ll x, ll k){
  ll res = 1;
  while(k > 0){
    if(k % 2){
      res *= x; res %= MOD;
    }
    x *= x; x %= MOD;
    k /= 2;
  }
  return res;
}

ll inverse(ll x){return pow_mod(x, MOD - 2);};

ll gcd(ll a, ll b){
    if(b == 0) return a;
    return gcd(b, a % b);
}

ll lcm(ll x, ll y){return x / gcd(x, y) * y;};

ll kai_mod(ll x){
  if(x == 0) return 1;
  return x * kai_mod(x-1) % MOD;
}

//約数の列挙O(√n)
vector<ll> divisor(ll n){
    vector<ll> res(0);
    for(ll i = 1; i * i <= n; i++){
        if(n % i == 0){
            res.push_back(i);
            if(i != n/i) res.push_back(n/i);
        }
    }
    sort(res.begin(), res.end());
    return res;
}

//素因数列挙
vector<ll> MakePrimeList(ll x) {
    vector<ll> res;
    for(ll k=2; k*k<=x; k++) {
        if(x % k == 0) {
            res.pb(k);
            while(x % k == 0) x /= k;
        }
    }
    if(x > 1) res.push_back(x);
    return res;
}



//コンビネーション
const int MAXcomb = 100010;
ll fac[MAXcomb], finv[MAXcomb], inv[MAXcomb];
//facはn!,finvは1/n!
//invは逆元
void COMinit(){
    fac[0] = fac[1] = 1;
    finv[0] = finv[1] = 1;
    inv[1] = 1;
    for(int i = 2; i < MAXcomb; i++){
        fac[i] = fac[i-1] * i % MOD;
        inv[i] = MOD - inv[MOD%i] * (MOD/i) % MOD;
        finv[i] = finv[i-1] * inv[i] % MOD;
    }
}
ll comb(int n, int k){
    if(n < k) return 0;
    if(n < 0 || k < 0) return 0;
    return fac[n] * finv[k] % MOD * finv[n-k] % MOD;
}
ll disit(ll x, ll d = 10){
  ll res = 0;
  while(x){
    res++;
    x /= d;
  }
  return res;
}

ll Cnt(ll D, vector<pair<ll, ll>> X){
  D *= 2;
  sort(X.begin(), X.end());
  ll last = -INFL;
  ll res = 0LL;
  rep(i, X.size()){
    if(X[i].f < last){
      X[i].f = last;
    }
    if(X[i].s < X[i].f) continue;
    res += (X[i].s - X[i].f) / D + 1;
    last = max(last, X[i].s + D);
  }
  return res;
}

void solve(){
  ll N, X, D;
  cin >> N >> X >> D;
  if(D == 0){
    if(X == 0) cout << 1 << endl;
    else cout << N + 1 << endl;
    return;
  }

  ll g = gcd(X, D);
  if(g != 0){
    X /= g;
    D /= g;
  }

  vector<pair<ll, pair<ll, ll>>> lr(N+1);
  ll all = N * (N-1) / 2 * D;
  rep(i, N+1){
    lr[i].s.f = (N - 2 * i) * X;
    lr[i].s.s = (N - 2 * i) * X;
    if(D > 0){
      lr[i].s.s += all - 2 * ((i-1) * (i) / 2 * D);
      lr[i].s.f += 2 * (N-1-i) * (N-i) / 2 * D - all;
    }else{
      lr[i].s.f += all - 2 * ((i-1) * (i) / 2 * D);
      lr[i].s.s += 2 * (N-1-i) * (N-i) / 2 * D - all;
    }
  }
  if(D < 0) D = -D;
  rep(i, N+1) lr[i].f = (lr[i].s.f % (2 * D) + (2 * D)) % (2 * D);
  sort(lr.begin(), lr.end());
  lr.pb({INFL, {1LL, -1LL}});
  vector<pair<ll, ll>> xs;
  xs.pb(lr[0].s);
  ll ans = 0;
  rep(i, N+2){
    if(i == 0) continue;
    if(lr[i-1].f != lr[i].f){
      ans += Cnt(D, xs);
      xs.resize(0);
      xs.pb(lr[i].s);
    }else{
      xs.pb(lr[i].s);
    }
  }
  cout << ans << endl;
}

int main(){
  cin.tie(0);
  ios::sync_with_stdio(false);
  solve();
}


Measured memory_bytes: 14000