Problem: Unary is a minimalistic Brainfuck dialect in which programs are written using only one token. 

Brainfuck programs use 8 commands: "+", "-", "[", "]", "<", ">", "." and "," (their meaning is not important for the purposes of this problem). Unary programs are created from Brainfuck programs using the following algorithm. First, replace each command with a corresponding binary code, using the following conversion table: 

  * ">"  →  1000, 
  * "<"  →  1001, 
  * "+"  →  1010, 
  * "-"  →  1011, 
  * "."  →  1100, 
  * ","  →  1101, 
  * "["  →  1110, 
  * "]"  →  1111. 



Next, concatenate the resulting binary codes into one binary number in the same order as in the program. Finally, write this number using unary numeral system — this is the Unary program equivalent to the original Brainfuck one.

You are given a Brainfuck program. Your task is to calculate the size of the equivalent Unary program, and print it modulo 1000003 (106 + 3).

Input

The input will consist of a single line p which gives a Brainfuck program. String p will contain between 1 and 100 characters, inclusive. Each character of p will be "+", "-", "[", "]", "<", ">", "." or ",".

Output

Output the size of the equivalent Unary program modulo 1000003 (106 + 3).

Examples

Input

,.


Output

220


Input

++++[&gt;,.&lt;-]


Output

61425

Note

To write a number n in unary numeral system, one simply has to write 1 n times. For example, 5 written in unary system will be 11111.

In the first example replacing Brainfuck commands with binary code will give us 1101 1100. After we concatenate the codes, we'll get 11011100 in binary system, or 220 in decimal. That's exactly the number of tokens in the equivalent Unary program.

Solution (in CPP):

Solution:
#include <bits/stdc++.h>
using namespace std;
const long long inf = 1e5 + 5;
const long long N = 1e9 + 7;
string alph = "abcdefghijklmnopqrstuvwxyz";
long long ModulerExponentiation(long long x, long long n, long long M) {
  long long result = 1;
  while (n > 0) {
    if (n % 2 == 1) result = (result * x) % M;
    x = (x * x) % M;
    n = n / 2;
  }
  return result;
}
void solve() {
  string s, sum;
  cin >> s;
  map<char, string> m = {{'>', "1000"}, {'<', "1001"}, {'+', "1010"},
                         {'-', "1011"}, {'.', "1100"}, {',', "1101"},
                         {']', "1111"}, {'[', "1110"}};
  for (long long i = 0; i < s.length(); i++) {
    sum += m[s[i]];
  }
  long long ans = 0;
  for (long long i = sum.length() - 1; i >= 0; i--) {
    long long x = 0;
    if (sum[i] == '1')
      x = ModulerExponentiation(2LL, (long long)sum.size() - i - 1, 1000003LL);
    ans = ((ans % 1000003) + (x % 1000003)) % 1000003;
  }
  cout << ans;
}
int32_t main() {
  solve();
  return 0;
}