#include <cstdio>
#include <random>
#include <chrono>
std::mt19937 rng(std::chrono::steady_clock::now().time_since_epoch().count());
typedef long long LL;
const int Mod = 998244353;
const int N = 1300;
int A[N][N], B[N][N], C[N][N];
int main() {
for (int i = 0; i < N; ++i) {
for (int j = 0; j < N; ++j) {
A[i][j] = rng() % Mod;
B[i][j] = rng() % Mod;
C[i][j] = 0;
}
}
for (int i = 0; i < N; ++i)
for (int k = 0; k < N; ++k)
for (int j = 0; j < N; ++j)
C[i][j] = (C[i][j] + (LL)A[i][k] * B[k][j]) % Mod;
int Ans = 0;
for (int i = 0; i < N; ++i)
for (int j = 0; j < N; ++j)
Ans ^= C[i][j];
printf("%d\n", Ans);
return 0;
}