#include<bits/stdc++.h> using namespace std; const int N = 1e3 + 10; const int K = 12345; int n; int f[N][2]; int main() { cin >> n; if (n == 1) { f[1][0] = 8; f[1][1] = 1; cout << f[1][0] << endl; } else { f[1][0] = 9; f[1][1] = 1; for (int i = 2; i <= n - 1; ++i) { //K = 12345 f[i][0] = ((f[i - 1][1] % K) + (9 * (f[i-1][0] % K)) % K) % K; f[i][1] = ((f[i - 1][0] % K) + (9 * (f[i-1][1] % K)) % K) % K; } f[n][0] = ((f[n - 1][1] % K) + (8 * (f[n-1][0] % K)) % K) % K; cout << f[n][0] << endl; }

return 0;

}