#include <iostream>
#include <sstream>
#include <string>
#include <algorithm>
#include <vector>
#include <stack>
#include <queue>
#include <set>
#include <map>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <cmath>
#include <cassert>

using namespace std;

#define FOR(i,k,n) for(int i=(k); i<(int)(n); ++i)
#define REP(i,n) FOR(i,0,n)
#define FORIT(i,c) for(__typeof((c).begin())i=(c).begin();i!=(c).end();++i)

template<class T> void debug(T begin, T end){ for(T i = begin; i != end; ++i) cerr<<*i<<" "; cerr<<endl; }
inline bool valid(int x, int y, int W, int H){ return (x >= 0 && y >= 0 && x < W && y < H); }

typedef long long ll;
const int INF = 100000000;
const double EPS = 1e-8;
const int MOD = 1000000007;
int dx[8] = {1, 0, -1, 0, 1, -1, -1, 1};
int dy[8] = {0, 1, 0, -1, 1, 1, -1, -1};
class ParseError {};
struct Result{
  int value, p, ex;
  Result(int v, int p) : value(v), p(p), ex(0) {}
};
void skip(const string& s, Result& r, char expected){
  if(!(0 <= r.p && r.p < s.size())){
    throw ParseError();
  }else if(s[r.p] != expected){
    throw ParseError();
  }else {
    r.p ++;
  }
}
void checkvalue(int x){
  if(x < 0 || x >= 1<<10) throw ParseError();
}
Result equation(const string& s, int p);
Result equation_in(const string& s, int p);
Result factor(const string& s, int p);
Result term(const string& s, int p);
Result equation(const string& s, int p){
  Result r = factor(s, p);
  while(r.p < s.size() && (s[r.p] == '+' || s[r.p] == '-')){
    Result r2 = factor(s, r.p + 1);
    if(s[r.p] == '+'){
      r.value += r2.value;
    }else if(s[r.p] == '-'){
      r.value -= r2.value;
    }
    r.p = r2.p;
    checkvalue(r.value);
  }
  return r;
}
Result equation_in(const string& s, int p){
  Result r = factor(s, p);
  while(r.p < s.size() && (s[r.p] == '+' || s[r.p] == '-')){
    Result r2 = factor(s, r.p + 1);
    if(s[r.p] == '+'){
      r.value += r2.value;
    }else if(s[r.p] == '-'){
      r.value -= r2.value;
    }
    r.p = r2.p;
    r.ex = 1;
    checkvalue(r.value);
  }
  if(r.ex == 0) throw ParseError();
  return r;
}
Result factor(const string& s, int p){
  Result r = term(s, p);
  r.ex = 0;
  while(r.p < s.size() && s[r.p] == '*'){
    Result r2 = term(s, r.p + 1);
    r.value *= r2.value;
    r.p = r2.p;
    r.ex = 1;
    checkvalue(r.value);
  }
  return r;
}
Result term(const string& s, int p){
  if(s[p] == '('){
    Result r = equation_in(s, p + 1);
    skip(s, r, ')');
    checkvalue(r.value);
    return r;
  }else if(isdigit(s[p])){
    int value = 0;
    while(isdigit(s[p]) && p < s.size()){
      value = (value << 1) + (s[p++] - '0');
    }
    checkvalue(value);
    return Result(value, p);
  }else {
    throw ParseError();
  }
}
string SYMBOLS = "01+-*()";
int dfs(int k, vector<int>& index, string& s){
  if(k == index.size()){
    try{
      Result r = equation(s, 0);
      if(r.p != s.size()) throw ParseError();
      //cout<<s<<" is "<<r.value<<endl;
      return r.value;
    }catch(...){
      //cout<<s<<" is invalid."<<endl;
      return -1;
    }
  }else{
    int res = -INF;
    REP(i, SYMBOLS.size()){
      s[index[k]] = SYMBOLS[i];
      res = max(res, dfs(k + 1, index, s));
    }
    return res;
  }
}

int main(){
  string s;
  while(cin>>s){
    vector<int> index;
    REP(i, s.size()) if(s[i] == '.') index.push_back(i);
    int ans = dfs(0, index, s);
    cout<<ans<<endl;
  }
  return 0;
}

Measured memory_bytes: 1276