#include <bits/stdc++.h>
using namespace std;
const long long N = 2e5;
const long long mod = 1e6 + 3;
long long test, n, query, q, k, value, m, x, val, a, b, c;
long long arr[N], brr[N];
long long powp(long long a, long long b) {
  if (b == 0) {
    return 1;
  }
  if (b == 1) {
    return a % mod;
  }
  if (b % 2 == 0) {
    long long xx = powp(a, b / 2);
    return ((xx % mod) * (xx % mod)) % mod;
  } else {
    return (a % mod * (powp(a, b - 1) % mod)) % mod;
  }
}
int main() {
  map<string, string> mp;
  mp[">"] = "1000";
  mp["<"] = "1001";
  mp["+"] = "1010";
  mp["-"] = "1011";
  mp["."] = "1100";
  mp[","] = "1101";
  mp["["] = "1110";
  mp["]"] = "1111";
  string str;
  cin >> str;
  string ans = "";
  for (int i = 0; i < str.length(); i++) {
    ans += mp[string(1, str[i])];
  }
  reverse(begin(ans), end(ans));
  long long ff = 0;
  for (int i = 0; i < ans.length(); i++) {
    if (ans[i] == '1') {
      ff = (ff % mod + powp(2, i) % mod) % mod;
    }
  }
  cout << ff << endl;
  return 0;
}
