#include <bits/stdc++.h>
using namespace std;
#define GET_MACRO(a, b, c, NAME, ...) NAME
#define rep(...) GET_MACRO(__VA_ARGS__, rep3, rep2)(__VA_ARGS__)
#define rep2(i, a) rep3 (i, 0, a)
#define rep3(i, a, b) for (int i = (a); i < (b); i++)
#define repr(...) GET_MACRO(__VA_ARGS__, repr3, repr2)(__VA_ARGS__)
#define repr2(i, a) repr3 (i, 0, a)
#define repr3(i, a, b) for (int i = (b) - 1; i >= (a); i--)
template<class T1, class T2> inline bool chmin(T1 &a, T2 b) { return b < a && (a = b, true); }
template<class T1, class T2> inline bool chmax(T1 &a, T2 b) { return a < b && (a = b, true); }
using ll = long long;

const ll mod = 1000003;

ll A[3][3] = {{1, -2, 2}, {2, -1, 2}, {2, -2, 3}};
ll B[3][3] = {{1, 2, 2}, {2, 1, 2}, {2, 2, 3}};
ll C[3][3] = {{-1, 2, 2}, {-2, 1, 2}, {-2, 2, 3}};

tuple<ll, ll, ll> next(ll M[3][3], ll x, ll y, ll z) {
	ll nx = M[0][0] * x + M[0][1] * y + M[0][2] * z;
	ll ny = M[1][0] * x + M[1][1] * y + M[1][2] * z;
	ll nz = M[2][0] * x + M[2][1] * y + M[2][2] * z;
	return make_tuple(nx, ny, nz);
}

int main() {
	ll L;
	cin >> L;

	queue<tuple<ll, ll, ll>> q;
	ll ans = 0;

	q.emplace(3, 4, 5);
	while (!q.empty()) {
		ll x, y, z;
		tie(x, y, z) = q.front(); q.pop();
		if (4 * (x + y + z) <= L) {
			ans++;
			q.push(next(A, x, y, z));
			q.push(next(B, x, y, z));
			q.push(next(C, x, y, z));
		}
	}
	ans %= mod;
	cout << ans << endl;

	return 0;
}