#define _CRT_SECURE_NO_WARNINGS
#include <vector>
#include <string>
#include <iostream>
#include <algorithm>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <fstream>
#include <map>
#include <set>
#include <queue>
#include <memory.h>
#include <time.h>
#include <iostream>
#include <string>
#include <cstring>
#include <vector>
#include <cmath>
#include <map>
#include <algorithm>
#include <cstdio>
#include <set>
#include <queue>
#include <cassert>
#include <climits>
#define sz(x) int((x).size())
#define FOR(i,a,b) for(ll(i) = (a); (i) <= (b); ++(i))
#define ROF(i,a,b) for(ll(i) = (a); (i) >= (b); --(i))
#define rep(i,n) for (int(i) = 0; (i) < (n); ++(i))
#define fe(i,a) for (ll(i) = 0; (i) < int((a).size()); ++(i))
#define C(a) memset((a),0,sizeof(a))
#define pb push_back
#define ppb pop_back
#define all(c) (c).begin(), (c).end()
#define sqr(a) (a)*(a)
#define mp(a,b) make_pair((a), (b))
#define X first
#define Y second
#define file freopen("input.txt","r",stdin)
#define file2 freopen("output.txt", "w",stdout)
#define text freopen("input.txt","r",stdin); freopen("output.txt", "w",stdout)
using namespace std;
typedef vector<int> vint;
typedef long long ll;
typedef unsigned long long ull;
typedef pair<int, int> pii;
#include <iostream>
#include <cstdio>
#include <cstdlib>
#include <cmath>
#include <cstring>
#include <string>
#include <vector>
#include <climits>
#include <cassert>
#define y1 vamdlsfmvldf
using namespace std;
const ll mod = (ll)1e9 + 7;
const ll INF = (ll)(1e17);
const int N = 1000050;
ll a, b, c, x0, x;
int n;
ll m_tmp[N];
ll mn[N];
int head;
int head_tmp;
int main(){
  cin >> n;
  cin >> a >> b >> c >> x0;
  head = -1;
  head_tmp = -1;
  ll sum = 0;
  ll mnt = mod;
  for(int i = 0; i < n; ++i){
      x = ((a * x0 + b) * x0 + c) / 100;
      x %= 1000000;
      x0 = x;
      //cout << x  << " " << x % 5 << endl;
      if(x % 5 < 2){
          if(head >= 0) --head;
          else{
              while(head_tmp >= 0){
                  mn[++head] = m_tmp[head_tmp--];
                  if(head >= 1) mn[head] = min(mn[head], mn[head - 1]);
              }
              head--;
              head = max(head, -1);
              mnt = mod;
          }
      }
      else{
          m_tmp[++head_tmp] = x;
          mnt = min(mnt, m_tmp[head_tmp]);
      }
      if(head >= 0)
          sum += min(mn[head], mnt);
     else if(head_tmp >= 0)
          sum += mnt;
      //cout << head << " " << head_tmp << endl;
      //cout << sum << endl;
  }
  cout << sum << endl;
  return 0;
}