#include <bits/stdc++.h>
char s[2002];
int tp[2001], nxt[2001];
long long dp[2001][2001];
int main() {
  scanf("%s", s + 1);
  int len = strlen(s + 1);
  for (int i = 1; i <= len; ++i)
    if ((s[i] == '*' || s[i] == '/') &&
        ((s[i - 1] < '0' || s[i - 1] > '9') ||
         ((s[i + 1] < '0' || s[i + 1] > '9') && s[i + 1] != '+' &&
          s[i + 1] != '-'))) {
      printf("0");
      return 0;
    }
  if (s[len] == '+' || s[len] == '-') {
    printf("0");
    return 0;
  }
  int n = 0;
  for (int i = 1; i <= len; ++i)
    if ((s[i] >= '0' && s[i] <= '9') && (s[i - 1] < '0' || s[i - 1] > '9')) {
      int j = i - 1;
      for (; j && (s[j] < '0' || s[j] > '9'); --j)
        ;
      j = i - j - 2;
      if (n == 0) ++j;
      while (j--) tp[++n] = 1;
      tp[++n] = 2;
      dp[n][n] = 1;
    }
  nxt[n] = -1;
  for (int i = n - 1; i >= 0; --i) nxt[i] = tp[i + 1] == 2 ? i + 1 : nxt[i + 1];
  for (int i = n - 1; i; --i)
    for (int j = i + 1; j <= n; ++j)
      if (tp[j] == 2) {
        if (tp[i] == 1) dp[i][j] = dp[i + 1][j];
        for (int k = nxt[i - 1]; k < j; k = nxt[k])
          dp[i][j] += dp[i][k] * dp[k + 1][j];
        dp[i][j] %= 1000003;
      }
  printf("%lld\n", dp[1][n]);
  return 0;
}
