60分，求调

#include<bits/stdc++.h>
using namespace std;
int n;
struct Win {
	int winteam;
	int winans;
};
Win x[1000010];
long long fens[1000010];
long long t;
int main() {
	cin >> n >> x[1].winteam;
	for(int i = 2;i <= n;i++) {
		t = x[i - 1].winteam * 3703 + 1047;
		x[i].winteam = (t % n) + 1;
	}
	fens[x[1].winteam]++;
	x[0].winans = 1;
	for(int i = 2;i <= n;i++) {
		if(x[i - 1].winteam == x[i].winteam){
			x[i].winans++;
			if(x[i].winans == 2) fens[x[i].winteam] += 2;
			else fens[x[i].winteam] += 3;
		}
		else {
			x[i].winans++;
			fens[x[i].winteam]++;
		}
	}
	stable_sort(fens + 1, fens + 1 + n, greater<int>());
	cout << fens[1];
	return 0;
}