#include <algorithm>
#include <cstdint>
#include <iostream>
#include <map>
#include <queue>
#include <ranges>
#include <set>
#include <sstream>
#include <string>
#include <string_view>
#include <vector>
using namespace std;

int64_t Seq(const vector<pair<int, int>>& v, int i) {
    return (v[i-3].second+9) + 19*((v[i-2].second+9) +
	   19*((v[i-1].second+9) + 19*(v[i].second+9)));
}

int64_t next(int64_t n) {
	constexpr int64_t M = 16777216;
	n = ((n*64) ^ n) % M;
	n = ((n/32) ^ n) % M;
	n = ((n*2048) ^ n) % M;
	return n;
}

int main() {
	int64_t s;
	vector<vector<pair<int, int>>> spc;
	vector<map<int64_t, int64_t>> tt;
	map<int64_t, int64_t> sums;
	set<int64_t> seqs;

	for (int i = 0; cin >> s; i++) {
		spc.push_back(vector<pair<int, int>>());
		tt.push_back(map<int64_t, int64_t>());

		for (int j = 0; j < 2000; j++) {
			int64_t t = next(s);
			spc[i].push_back({t%10, t%10 - s%10});
			s = t;
			if (j >= 3) {
				auto k = Seq(spc[i], j);
				seqs.insert(k);
				if (tt[i].count(k) == 0)
					tt[i][k] = spc[i][j].first;
			}
		}
	}

	for (unsigned i = 0; i < spc.size(); i++)
		for (auto [k, v] : tt[i])
			sums[k] += v;

	auto values = views::values(sums);
	auto best = *max_element(values.begin(), values.end());
	cout << best << endl;

	return 0;
}