#include <bits/stdc++.h>
using namespace std;
long long choose(long long n, long long k) {
  if (k == 0) return 1;
  return (n * choose(n - 1, k - 1)) / k;
}
long long gcd(long long a, long long b) {
  if (!a) return b;
  return gcd(b % a, a);
}
long long gcdExtended(long long a, long long b, long long *x, long long *y) {
  if (a == 0) {
    *x = 0, *y = 1;
    return b;
  }
  long long x1, y1;
  long long gcd = gcdExtended(b % a, a, &x1, &y1);
  *x = y1 - (b / a) * x1;
  *y = x1;
  return gcd;
}
long long modInv(long long a, long long m) {
  long long x, y;
  long long g = gcdExtended(a, m, &x, &y);
  long long res = (x % m + m) % m;
  return res;
}
long long mpower(long long x, long long y, long long p) {
  long long res = 1;
  x = x % p;
  while (y > 0) {
    if (y & 1) {
      res = (res * x) % p;
    }
    y = y >> 1;
    x = (x * x) % p;
  }
  return res;
}
long long power(long long x, long long y) {
  long long res = 1;
  while (y > 0) {
    if (y & 1) res = res * x;
    y = y >> 1;
    x = x * x;
  }
  return res;
}
long long lcm(long long a, long long b) { return (a * b) / gcd(a, b); }
int main() {
  ios_base::sync_with_stdio(0);
  cin.tie(0);
  cout.tie(0);
  long long l, r, x, y;
  cin >> l >> r >> x >> y;
  if (y % x != 0) {
    cout << 0;
    return 0;
  }
  long long temp = y / x;
  long long count = 0;
  vector<long long> v;
  for (long long i = 1; i * i <= temp; i++) {
    if (temp % i == 0) {
      v.push_back(i);
      if (temp != i * i) v.push_back(temp / i);
    }
  }
  set<pair<long long, long long> > s;
  long long cnt = 0;
  for (long long i = 0; i < v.size(); i++) {
    long long k1 = v[i];
    long long k2 = temp / v[i];
    if (l <= x * k1 && x * k1 <= r) {
      if (l <= x * k2 && x * k2 <= r) {
        long long tmp = gcd(x * k1, x * k2);
        if (tmp == x && (x * k1 * x * k2) % tmp == 0 &&
            lcm(x * k1, x * k2) == y) {
          if (!s.count(make_pair(k1, k2))) {
            cnt++;
            s.insert(make_pair(k1, k2));
          }
        }
      }
    }
  }
  cout << cnt;
}
