#include <bits/stdc++.h>
using namespace std;
int n, m;
int k;
bool debug = false;
const int mod = 1000003;
char s[2007];
int pos[2007], dp[2007][2007], g[2007][2007];
int main() {
  scanf("%s", s + 1);
  n = strlen(s + 1);
  if (s[n] < 48) {
    puts("0");
    return 0;
  }
  for (int i = 1; i <= n; i++) {
    if (s[i] < 48) {
      if (s[i] == '+' || s[i] == '-' || (i > 1 && s[i - 1] >= '0')) {
        if (s[i + 1] == '+' || s[i + 1] == '-') pos[m] = 1;
      } else {
        puts("0");
        return 0;
      }
      m++;
    }
  }
  dp[0][0] = 1;
  for (int i = 0; i < m; i++) {
    for (int j = 0; j <= m; j++) {
      g[i][j] = dp[i][j];
      if (j) g[i][j] = (g[i][j] + g[i][j - 1]) % mod;
    }
    if (pos[i]) {
      for (int j = 1; j < m; j++) {
        dp[i + 1][j] = (dp[i + 1][j] + g[i][j]) % mod;
      }
    } else {
      for (int j = 0; j < m; j++) {
        dp[i + 1][j] = (dp[i + 1][j] + g[i][j + 1]) % mod;
      }
    }
  }
  cout << dp[m][0];
  return 0;
}
