#include "bits/stdc++.h"
#include<unordered_map>
#include<unordered_set>
#pragma warning(disable:4996)
using namespace std;
using ld = long double;
template<class T>
using Table = vector<vector<T>>;



int mod = 1000000007;
struct Mod {
public:
	int num;
	Mod() : Mod(0) { ; }
	Mod(long long int n) : num((n % mod + mod) % mod) {
		//static_assert(mod<INT_MAX / 2, "mod is too big, please make num 'long long int' from 'int'");
	}
	Mod(int n) : Mod(static_cast<long long int>(n)) { ; }
	operator int() { return num; }
};

Mod operator+(const Mod a, const Mod b) { return Mod((a.num + b.num) % mod); }
Mod operator+(const long long int a, const Mod b) { return Mod(a) + b; }
Mod operator+(const Mod a, const long long int  b) { return b + a; }
Mod operator++(Mod &a) { return a + Mod(1); }
Mod operator-(const Mod a, const Mod b) { return Mod((mod + a.num - b.num) % mod); }
Mod operator-(const long long int a, const Mod b) { return Mod(a) - b; }
Mod operator--(Mod &a) { return a - Mod(1); }
Mod operator*(const Mod a, const Mod b) { return Mod(((long long)a.num * b.num) % mod); }
Mod operator*(const long long int a, const Mod b) { return Mod(a)*b; }
Mod operator*(const Mod a, const long long int b) { return Mod(b)*a; }
Mod operator*(const Mod a, const int b) { return Mod(b)*a; }
Mod operator+=(Mod &a, const Mod b) { return a = a + b; }
Mod operator+=(long long int &a, const Mod b) { return a = a + b; }
Mod operator-=(Mod &a, const Mod b) { return a = a - b; }
Mod operator-=(long long int &a, const Mod b) { return a = a - b; }
Mod operator*=(Mod &a, const Mod b) { return a = a * b; }
Mod operator*=(long long int &a, const Mod b) { return a = a * b; }
Mod operator*=(Mod& a, const long long int &b) { return a = a * b; }
Mod operator^(const Mod a, const int n) {
	if (n == 0) return Mod(1);
	Mod res = (a * a) ^ (n / 2);
	if (n % 2) res = res * a;
	return res;
}
Mod mod_pow(const Mod a, const int n) {
	if (n == 0) return Mod(1);
	Mod res = mod_pow((a * a), (n / 2));
	if (n % 2) res = res * a;
	return res;
}
Mod inv(const Mod a) { return a ^ (mod - 2); }
Mod operator/(const Mod a, const Mod b) {
	assert(b.num != 0);
	return a * inv(b);
}
Mod operator/(const long long int a, const Mod b) {
	assert(b.num != 0);
	return Mod(a) * inv(b);
}
Mod operator/=(Mod &a, const Mod b) {
	assert(b.num != 0);
	return a = a * inv(b);
}

#define MAX_MOD_N 1024000

Mod fact[MAX_MOD_N], factinv[MAX_MOD_N];
void init() {
	fact[0] = Mod(1); factinv[0] = 1;
	for (int i = 0; i < MAX_MOD_N - 1; ++i) {
		fact[i + 1] = fact[i] * Mod(i + 1);
		factinv[i + 1] = factinv[i] / Mod(i + 1);
	}
}
Mod comb(const int a, const int b) {
	return fact[a] * factinv[b] * factinv[a - b];
}


int main() {
	while (1) {
		int N, S, W, Q; cin >> N >> S >> W >> Q;
		if (Q == 2 || Q == 5) {
			if (!N)break;
			mod = Q;
			vector<Mod>a(N);
			vector<bool> zero(N);
			int g = S;
			for (int i = 0; i<N; i++) {
				a[i] = (g / 7) % 10;
				zero[i] = (g / 7) % 10 == 0;
				if (g % 2 == 0) { g = (g / 2); }
				else { g = (g / 2) ^ W; }
			}
			int ans = 0;
			int kouho = 0;
			for (int i = 0; i < N; ++i) {
				if (!zero[i])kouho++;
				if (!a[i] % Q) {
					ans += kouho;
				}
			}
			cout << ans << endl;
		}
		else {
			if (!N)break;
			mod = Q;
			vector<Mod>a(N);
			vector<bool> zero(N);
			int g = S;
			for (int i = 0; i<N; i++) {
				a[i] = (g / 7) % 10;
				zero[i] = (g / 7) % 10 == 0;
				if (g % 2 == 0) { g = (g / 2); }
				else { g = (g / 2) ^ W; }
			}
			for (int i = 0; i < N; ++i) {
				a[i] = a[i] * mod_pow(10, N - i - 1);
			}
			vector<Mod>sum(N + 1);
			sum[0] = 0;
			for (int i = 0; i < N; ++i) {
				sum[i + 1] = sum[i] + a[i];
			}
			long long int ans = 0;
			map<int, int>mp;

			for (int r = 0; r < N; ++r) {
				if (!zero[r]) {
					mp[sum[r]]++;
				}
				ans += mp[int(sum[r + 1])];

			}
			cout << ans << endl;
		}
		
	}
	return 0;
}

Measured memory_bytes: 15884