#include <iostream>

#include <vector>

using namespace std;

bool Bsearch(long key,  const vector<long> & seq, int start, int stop) {
    if (start > stop) {
       return false;
    }

    int mid = (start + stop) / 2;
    if (seq[mid] == key) {
       return true;
    }
    if (seq[mid] < key) {
       return (Bsearch(key, seq, mid+1, stop));
    } else {
       return (Bsearch(key, seq, start, mid-1));
    }
}

int main() {
     long n,m,a,c,x0;

    cin >> n >> m >> a >> c >> x0;

    vector<long> seq;

    long xOld = x0;
    long xNew;

    for(int i=0;i<n;i++) {
        xNew =  ((xOld * a) %m  + c) % m;
	seq.push_back(xNew);
	xOld = xNew;
    }

    int count = 0;
    for(auto x: seq) {
       if (Bsearch(x,seq,0, seq.size()-1)) {
          count ++;
       }
    }

    cout << count << endl;
    return 0;
}