快速幂的裸题,但是但是没看出来,反思QAQ
#include <bits/stdc++.h>
using namespace std;
int power(int a, int b, int p)
{
int ans = 1 % p;
while(b)
{
if(b & 1) ans = (long long) ans * a % p;
a = (long long) a * a % p;
b >>= 1;
}
return ans;
}
int main()
{
int n;
cin >> n;
int x = power(n, n, n + 2);
cout << x;
return 0;
}