#include <bits/stdc++.h>
using namespace std;
long long fpm(long long b, long long e, long long m) {
  long long t = 1;
  for (; e; e >>= 1, b = b * b % m) e & 1 ? t = t * b % m : 0;
  return t;
}
template <class T>
inline bool chkmin(T &a, T b) {
  return a > b ? a = b, true : false;
}
template <class T>
inline bool chkmax(T &a, T b) {
  return a < b ? a = b, true : false;
}
template <class T>
inline T sqr(T x) {
  return x * x;
}
template <class edge>
struct Graph {
  vector<vector<edge> > adj;
  Graph(int n) {
    adj.clear();
    adj.resize(n + 5);
  }
  Graph() { adj.clear(); }
  void resize(int n) { adj.resize(n + 5); }
  void add(int s, edge e) { adj[s].push_back(e); }
  void del(int s, edge e) {
    adj[s].erase(find((adj[s]).begin(), (adj[s]).end(), e));
  }
  int deg(int v) { return adj[v].size(); }
  vector<edge> &operator[](int t) { return adj[t]; }
};
const int maxn = 2200, mod = 1000003;
string S, T;
int f[maxn][maxn];
int main() {
  ios_base::sync_with_stdio(false);
  cin >> S;
  char lx = 0;
  for (auto &c : S) {
    if (!isdigit(c) && !isdigit(lx))
      if (c == '*' || c == '/')
        return cout << 0 << endl, 0;
      else
        T.push_back('1');
    else if (!isdigit(lx))
      T.push_back('0');
    lx = c;
  }
  if (!isdigit(lx)) return cout << 0 << endl, 0;
  int n = (int)((T).size());
  f[0][1] = 1;
  for (int i = 1; i < n; ++i)
    for (int j = i + 1; j; --j)
      f[i][j] = (f[i - 1][j - 1] + f[i][j + 1] * (T[i] == '0')) % mod;
  cout << f[n - 1][1] << endl;
  return 0;
}
