#include <bits/stdc++.h>
using namespace std;

template<class T>
bool chmax(T& a, const T& b) {
    if (a < b) { a = b; return true; }
    return false;
}
template<class T>
bool chmin(T& a, const T& b) {
    if (b < a) { a = b; return true; }
    return false;
}

// std::vector Declaration
template<typename T>
vector<T> make_v(size_t a) { return vector<T>(a); }
template<typename T, typename... Ts>
auto make_v(size_t a, Ts... ts) {
    return vector<decltype(make_v<T>(ts...))>(a, make_v<T>(ts...));
}

// std::vector Declaration and Initialization
template<typename T>
vector<T> make_vector(size_t a, T x) { return vector<T>(a, x); }
template<typename T, typename U, typename... Ts>
auto make_vector(size_t a, U b, Ts... ts) {
    return vector<decltype(make_vector<T>(b,ts...))>(a, make_vector<T>(b, ts...));
}

// std::vector Input
template<typename T>
istream& operator>>(istream& is, vector<T>& v) {
    for (auto &e : v) is >> e;
    return is;
}

// std::vector Debug
template<typename T>
ostream& operator<<(ostream& os, const vector<T>& v) {
    os << "[";
    bool a = 1;
    for (auto e : v) {
        os << (a ? "" : " ");
        os << e;
        a = 0;
    }
    os << "]";
    return os;
}

// std::array Debug
template<typename T, size_t n>
ostream& operator<<(ostream& os, const array<T, n>& v) {
    os << "[";
    bool a = 1;
    for (auto e : v) {
        os << (a ? "" : " ");
        os << e;
        a = 0;
    }
    os << "]";
    return os;
}

// std::deque Debug
template<typename T>
ostream& operator<<(ostream& os, const deque<T>& d) {
    os << "[";
    bool a = 1;
    for (auto e : d) {
        os << (a ? "" : " ");
        os << e;
        a = 0;
    }
    os << "]";
    return os;
}

// std::pair Debug
template<typename T, typename U>
ostream& operator<<(ostream& os, const pair<T, U>& p) {
    os << "(" << p.first << " " << p.second << ")";
    return os;
}

// std::set Debug
template<typename T>
ostream& operator<<(ostream& os, const set<T>& st) {
    os << "{";
    bool a = 1;
    for (auto e : st) {
        os << (a ? "" : " ");
        os << e;
        a = 0;
    }
    os << "}";
    return os;
}

// std::multiset Debug
template<typename T>
ostream& operator<<(ostream& os, const multiset<T>& st) {
    os << "{";
    bool a = 1;
    for (auto e : st) {
        os << (a ? "" : " ");
        os << e;
        a = 0;
    }
    os << "}";
    return os;
}

// std::map Debug
template<typename T, typename U>
ostream& operator<<(ostream& os, const map<T, U>& mp) {
    os << "{";
    bool a = 1;
    for (auto e : mp) {
        os << (a ? "" : " ");
        os << e.first << ":" << e.second;
        a = 0;
    }
    os << "}";
    return os;
}

// std::tuple Debug
template<int N, class Tuple>
void out(ostream& os, const Tuple& t){}
template<int N, class Tuple, class H, class ...Ts>
void out(ostream& os, const Tuple& t) {
    if (N) os << " ";
    os << get<N>(t);
    out<N+1,Tuple,Ts...>(os, t);
}
template<class ...Ts>
ostream& operator<<(ostream& os, const tuple<Ts...>& t) {
    os << "(";
    out<0,tuple<Ts...>,Ts...>(os, t);
    os << ")";
    return os;
}

// Debug
#define DUMP(x) cerr<<#x<<" = "<<(x)<<endl

// Weighted edge
template<typename T>
struct edge {
    int src, to;
    T cost;

    edge() {}
    edge(int to, T cost) : src(-1), to(to), cost(cost) {}
    edge(int src, int to, T cost) : src(src), to(to), cost(cost) {}

    friend ostream& operator<<(ostream& os, const edge& e) {
        return os << "(" << e.src << "->" << e.to << ":" << e.cost << ")";
    }
};

using LL = int64_t;

#define fs first
#define sc second

const int64_t MOD = 1e9+7;

using State = string::const_iterator;
class ParseError {};

int number(State& begin) {
    int ret = 0;
    while (*begin == '0' or *begin == '1') {
        ret <<= 1;
        ret += (*begin - '0');
        if (ret < 0 or 1<<10 <= ret) {
            throw ParseError();
        }
        ++begin;
    }
    return ret;
}

pair<int,int> expression(State& begin);

int factor(State& begin) {
    if (*begin == '(') {
        ++begin;
        int ret, cnt; tie(ret, cnt) = expression(begin);
        if (cnt == 0) {
            throw ParseError();
        }
        if (ret < 0 or 1<<10 <= ret) {
            throw ParseError();
        }
        if (*begin != ')') {
            throw ParseError();
        }
        ++begin;
        return ret;
    } else if (*begin == '0' or *begin == '1') {
        return number(begin);
    } else {
        throw ParseError();
    }
}

pair<int,int> term(State& begin) {
    int prod = 1, cnt = 0;
    while (true) {
        prod *= factor(begin);
        if (prod < 0 or 1<<10 <= prod) {
            throw ParseError();
        }
        if (*begin != '*') {
            return { prod, cnt };
        }
        ++cnt;
        ++begin;
    }
}

pair<int,int> expression(State& begin) {
    int sum = 0, cnt = 0;
    int plus = 1;
    while (true) {
        int s, c; tie(s, c) = term(begin);
        sum += s * plus;
        cnt += c;
        if (sum < 0 or 1<<10 <= sum) {
            throw ParseError();
        }
        if (*begin == '+') {
            plus = 1;
        } else if (*begin == '-') {
            plus = -1;
        } else {
            return { sum, cnt };
        }
        ++cnt;
        ++begin;
    }
}

void test_number() {
    string s = "1010";
    State begin = s.begin();
    assert(number(begin) == 10);
}
void test() {
    //string s = "1+10*10+10*(10+10+1)";
    //State begin = s.begin();
    //assert(expression(begin).first == 15);
    string s = "(1+1+1)";
    State begin = s.begin();
    assert(expression(begin).first == 3);
}


int main()
{
    cin.tie(0);
    ios::sync_with_stdio(false);
    cout << fixed << setprecision(10);


    test_number();
    test();

    string s; cin >> s;
    vector<int> unknown;
    for (int i = 0; i < s.size(); ++i) {
        if (s[i] == '.') {
            unknown.push_back(i);
        }
    }

    int m = unknown.size();

    vector<int> a(m+1);
    vector<char> ch{'0', '1', '+', '*', '-', '(', ')'};

    int ans = numeric_limits<int>::min();

    while (!a[m]) {

        string t = s;
        for (int i = 0; i < m; ++i) {
            t[unknown[i]] = ch[a[i]];
        }

        State begin = t.begin();
        try {
            int val = expression(begin).first;
            if (*begin == '\0') {
                chmax(ans, val);
            }
        } catch (const ParseError& e) {
        }

        for (int i = 0; ++a[i] == ch.size(); ++i) a[i] = 0;
    }

    cout << (ans == numeric_limits<int>::min() ? -1 : ans) << endl;

    return 0;
}



Measured memory_bytes: 3280