#include<stdio.h>
long long int pow_mod(long long int x, long long int n,long long int mod) {
	
	long long int ans = 1;
	////为了满足求模运算的规则：(a*b)%p=((a%p) * (b%p))%p
	x = x % mod;
	while (n>0) {
		if (n % 2 == 1) {
			ans = (ans * x) % mod;//n转换成二进制，除下来这个位是1
		}
		x = (x * x) % mod;
		n = n>>1  ;//n变成二进制整体右移 等同于 n = n/2; 
	}
	return ans;
	
}
int main() {

	long long int x, n;
	scanf("%lld %lld", &x, &n);
	printf("%lld",pow_mod(x, n, 233333));
	return 0;
}