#include <bits/stdc++.h>   char s[101];   char t[10] =  ><+-.,[] ;   int c[10] = {8, 9, 10, 11, 12, 13, 14, 15};   void func() {     int n = strlen(s), i, j, ans = 0;     const int mod = 1000003;     for (i = 0; i < n; i++) {       for (j = 0; j < 8; j++) {         if (t[j] == s[i]) {           ans = (ans * 16 + c[j]) % mod;           break;         }       }     }     printf( %d n , ans);   }   int main(int argc, char **argv) {     while (scanf( %s , s) == 1) {       func();     }     return 0;   }   