#include <iostream>
#include <algorithm>
typedef int Int;
#define int long long
using namespace std;
int n;
const int N = 1e8,mod=6662333;
int fact[N],ifact[N];
int ksm(int a,int b) {
	int ans = 1;
	while (b) {
		if (b & 1) {
			ans = 1ll*ans*a%mod;
		}
		a = 1ll * a * a % mod;
		b /= 2;
	}
	return ans;
}
int C(int a,int b) {
	if (a < b) return 0;
	return 1ll * fact[a]*ifact[a-b]%mod*ifact[b]%mod;
}
Int main() {
	scanf("%lld",&n);
	fact[0] = 1;
	for (int i = 1;i <= n;++ i) {
		fact[i] = 1ll * fact[i-1]*i%mod;
	}
	ifact[n] = ksm(fact[n],mod-2);
	for (int i = n;i >= 1;-- i) {
		ifact[i-1] = 1LL * ifact[i]*i%mod;
	}
	int ans = 0;
	for (int i = 0;i <= n;i += 2) {
		ans = (ans+C(n,i))%mod;
	}
	printf("%lld",ans);
	return 0;
}