#include <bits/stdc++.h>   using namespace std;   const long long int MOD = 1e6 + 3;   const long double PI = 2 * acos(0.0);   const vector<long long int> dx = {1, -1, 0, 0};   const vector<long long int> dy = {0, 0, 1, -1};   template <typename T = long long int>   vector<T> ga(long long int n, bool oneIndexed = false) {     vector<T> a = vector<T>(n + oneIndexed);     for (long long int i = 0; i < n; i++) {       T p;       cin >> p;       a[i + oneIndexed] = p;     }     return move(a);   }   template <typename T, typename A>   void pa(vector<T, A> const &a, long long int begin = 0,           long long int end = -1) {     if (end == -1) end = (long long int)a.size() - 1;     for (long long int i = begin; i <= end; i++) {       cout << a[i] <<    ;     }     cout <<   n ;   }   template <typename T>   T po(T base, T exp) {     T result = 1;     for (;;) {       if (exp & 1) result *= base;       exp >>= 1;       if (!exp) break;       base *= base;     }     return result;   }   template <typename T>   T pomod(T x, T y, T mod) {     T res = 1;     x = x % mod;     while (y > 0) {       if (y & 1) res = (res * x) % mod;       y = y >> 1;       x = (x * x) % mod;     }     return res;   }   void solve() {     long long int n;     cin >> n;     if (n == 0)       cout << 1 <<   n ;     else       cout << pomod(3ll, n - 1, MOD);   }   int main(void) {     ios::sync_with_stdio(0);     cin.tie(0);     cout.tie(0);     solve();     return 0;   }   