// #pragma GCC target("avx2")
// #pragma GCC optimize("O3")
// #pragma GCC optimize("unroll-loops")
#include <bits/stdc++.h>
using namespace std;

namespace templates {
// type
using ll  = long long;
using ull = unsigned long long;
using Pii = pair<int, int>;
using Pil = pair<int, ll>;
using Pli = pair<ll, int>;
using Pll = pair<ll, ll>;
template <class T>
using pq = priority_queue<T>;
template <class T>
using qp = priority_queue<T, vector<T>, greater<T>>;
// clang-format off
#define vec(T, A, ...) vector<T> A(__VA_ARGS__);
#define vvec(T, A, h, ...) vector<vector<T>> A(h, vector<T>(__VA_ARGS__));
#define vvvec(T, A, h1, h2, ...) vector<vector<vector<T>>> A(h1, vector<vector<T>>(h2, vector<T>(__VA_ARGS__)));
// clang-format on

// for loop
#define fori1(a) for (ll _ = 0; _ < (a); _++)
#define fori2(i, a) for (ll i = 0; i < (a); i++)
#define fori3(i, a, b) for (ll i = (a); i < (b); i++)
#define fori4(i, a, b, c) for (ll i = (a); ((c) > 0 || i > (b)) && ((c) < 0 || i < (b)); i += (c))
#define overload4(a, b, c, d, e, ...) e
#define fori(...) overload4(__VA_ARGS__, fori4, fori3, fori2, fori1)(__VA_ARGS__)

// declare and input
// clang-format off
#define INT(...) int __VA_ARGS__; inp(__VA_ARGS__);
#define LL(...) ll __VA_ARGS__; inp(__VA_ARGS__);
#define STRING(...) string __VA_ARGS__; inp(__VA_ARGS__);
#define CHAR(...) char __VA_ARGS__; inp(__VA_ARGS__);
#define DOUBLE(...) double __VA_ARGS__; STRING(str___); __VA_ARGS__ = stod(str___);
#define VEC(T, A, n) vector<T> A(n); inp(A);
#define VVEC(T, A, n, m) vector<vector<T>> A(n, vector<T>(m)); inp(A);
// clang-format on

// const value
const ll MOD1   = 1000000007;
const ll MOD9   = 998244353;
const double PI = acos(-1);

// other macro
#ifndef RIN__LOCAL
// #define endl "\n"
#endif
#define spa ' '
#define len(A) ll(A.size())
#define all(A) begin(A), end(A)

// function
vector<char> stoc(string &S) {
    int n = S.size();
    vector<char> ret(n);
    for (int i = 0; i < n; i++) ret[i] = S[i];
    return ret;
}
string ctos(vector<char> &S) {
    int n      = S.size();
    string ret = "";
    for (int i = 0; i < n; i++) ret += S[i];
    return ret;
}

template <class T>
auto min(const T &a) {
    return *min_element(all(a));
}
template <class T>
auto max(const T &a) {
    return *max_element(all(a));
}
template <class T, class S>
auto clamp(T &a, const S &l, const S &r) {
    return (a > r ? r : a < l ? l : a);
}
template <class T, class S>
inline bool chmax(T &a, const S &b) {
    return (a < b ? a = b, 1 : 0);
}
template <class T, class S>
inline bool chmin(T &a, const S &b) {
    return (a > b ? a = b, 1 : 0);
}
template <class T, class S>
inline bool chclamp(T &a, const S &l, const S &r) {
    auto b = clamp(a, l, r);
    return (a != b ? a = b, 1 : 0);
}

template <typename T>
T sum(vector<T> &A) {
    T tot = 0;
    for (auto a : A) tot += a;
    return tot;
}

template <typename T>
vector<T> compression(vector<T> X) {
    sort(all(X));
    X.erase(unique(all(X)), X.end());
    return X;
}

// input and output
namespace io {

// vector<T>
template <typename T>
istream &operator>>(istream &is, vector<T> &A) {
    for (auto &a : A) is >> a;
    return is;
}
template <typename T>
ostream &operator<<(ostream &os, vector<T> &A) {
    for (size_t i = 0; i < A.size(); i++) {
        os << A[i];
        if (i != A.size() - 1) os << ' ';
    }
    return os;
}

// vector<vector<T>>
template <typename T>
istream &operator>>(istream &is, vector<vector<T>> &A) {
    for (auto &a : A) is >> a;
    return is;
}
template <typename T>
ostream &operator<<(ostream &os, vector<vector<T>> &A) {
    for (size_t i = 0; i < A.size(); i++) {
        os << A[i];
        if (i != A.size() - 1) os << endl;
    }
    return os;
}

// pair<S, T>
template <typename S, typename T>
istream &operator>>(istream &is, pair<S, T> &A) {
    is >> A.first >> A.second;
    return is;
}
template <typename S, typename T>
ostream &operator<<(ostream &os, pair<S, T> &A) {
    os << A.first << ' ' << A.second;
    return os;
}

// vector<pair<S, T>>
template <typename S, typename T>
istream &operator>>(istream &is, vector<pair<S, T>> &A) {
    for (size_t i = 0; i < A.size(); i++) {
        is >> A[i];
    }
    return is;
}
template <typename S, typename T>
ostream &operator<<(ostream &os, vector<pair<S, T>> &A) {
    for (size_t i = 0; i < A.size(); i++) {
        os << A[i];
        if (i != A.size() - 1) os << endl;
    }
    return os;
}

// tuple
template <typename T, size_t N>
struct TuplePrint {
    static ostream &print(ostream &os, const T &t) {
        TuplePrint<T, N - 1>::print(os, t);
        os << ' ' << get<N - 1>(t);
        return os;
    }
};
template <typename T>
struct TuplePrint<T, 1> {
    static ostream &print(ostream &os, const T &t) {
        os << get<0>(t);
        return os;
    }
};
template <typename... Args>
ostream &operator<<(ostream &os, const tuple<Args...> &t) {
    TuplePrint<decltype(t), sizeof...(Args)>::print(os, t);
    return os;
}

// io functions
void FLUSH() {
    cout << flush;
}

void print() {
    cout << endl;
}
template <class Head, class... Tail>
void print(Head &&head, Tail &&...tail) {
    cout << head;
    if (sizeof...(Tail)) cout << spa;
    print(std::forward<Tail>(tail)...);
}

template <typename T, typename S>
void prisep(vector<T> &A, S sep) {
    int n = A.size();
    for (int i = 0; i < n; i++) {
        cout << A[i];
        if (i != n - 1) cout << sep;
    }
    cout << endl;
}
template <typename T, typename S>
void priend(T A, S end) {
    cout << A << end;
}
template <typename T>
void prispa(T A) {
    priend(A, spa);
}
template <typename T, typename S>
bool printif(bool f, T A, S B) {
    if (f)
        print(A);
    else
        print(B);
    return f;
}

template <class... T>
void inp(T &...a) {
    (cin >> ... >> a);
}

} // namespace io
using namespace io;

// read graph
vector<vector<int>> read_edges(int n, int m, bool direct = false, int indexed = 1) {
    vector<vector<int>> edges(n, vector<int>());
    for (int i = 0; i < m; i++) {
        INT(u, v);
        u -= indexed;
        v -= indexed;
        edges[u].push_back(v);
        if (!direct) edges[v].push_back(u);
    }
    return edges;
}
vector<vector<int>> read_tree(int n, int indexed = 1) {
    return read_edges(n, n - 1, false, indexed);
}

template <typename T = long long>
vector<vector<pair<int, T>>> read_wedges(int n, int m, bool direct = false, int indexed = 1) {
    vector<vector<pair<int, T>>> edges(n, vector<pair<int, T>>());
    for (int i = 0; i < m; i++) {
        INT(u, v);
        T w;
        inp(w);
        u -= indexed;
        v -= indexed;
        edges[u].push_back({v, w});
        if (!direct) edges[v].push_back({u, w});
    }
    return edges;
}
template <typename T = long long>
vector<vector<pair<int, T>>> read_wtree(int n, int indexed = 1) {
    return read_wedges<T>(n, n - 1, false, indexed);
}

// yes / no
namespace yesno {

// yes
inline bool yes(bool f = true) {
    cout << (f ? "yes" : "no") << endl;
    return f;
}
inline bool Yes(bool f = true) {
    cout << (f ? "Yes" : "No") << endl;
    return f;
}
inline bool YES(bool f = true) {
    cout << (f ? "YES" : "NO") << endl;
    return f;
}

// no
inline bool no(bool f = true) {
    cout << (!f ? "yes" : "no") << endl;
    return f;
}
inline bool No(bool f = true) {
    cout << (!f ? "Yes" : "No") << endl;
    return f;
}
inline bool NO(bool f = true) {
    cout << (!f ? "YES" : "NO") << endl;
    return f;
}

// possible
inline bool possible(bool f = true) {
    cout << (f ? "possible" : "impossible") << endl;
    return f;
}
inline bool Possible(bool f = true) {
    cout << (f ? "Possible" : "Impossible") << endl;
    return f;
}
inline bool POSSIBLE(bool f = true) {
    cout << (f ? "POSSIBLE" : "IMPOSSIBLE") << endl;
    return f;
}

// impossible
inline bool impossible(bool f = true) {
    cout << (!f ? "possible" : "impossible") << endl;
    return f;
}
inline bool Impossible(bool f = true) {
    cout << (!f ? "Possible" : "Impossible") << endl;
    return f;
}
inline bool IMPOSSIBLE(bool f = true) {
    cout << (!f ? "POSSIBLE" : "IMPOSSIBLE") << endl;
    return f;
}

// Alice Bob
inline bool Alice(bool f = true) {
    cout << (f ? "Alice" : "Bob") << endl;
    return f;
}
inline bool Bob(bool f = true) {
    cout << (f ? "Bob" : "Alice") << endl;
    return f;
}

// Takahashi Aoki
inline bool Takahashi(bool f = true) {
    cout << (f ? "Takahashi" : "Aoki") << endl;
    return f;
}
inline bool Aoki(bool f = true) {
    cout << (f ? "Aoki" : "Takahashi") << endl;
    return f;
}

} // namespace yesno
using namespace yesno;

} // namespace templates
using namespace templates;

struct RandomNumberGenerator {
    std::mt19937 mt;
    RandomNumberGenerator() : mt(std::chrono::steady_clock::now().time_since_epoch().count()) {}
    RandomNumberGenerator(int seed) : mt(seed) {}

    int operator()(int a, int b) {
        std::uniform_int_distribution<int> dist(a, b - 1);
        return dist(mt);
    }

    int operator()(int b) {
        return (*this)(0, b);
    }

    template <typename T>
    void shuffle(std::vector<T> &v) {
        std::shuffle(v.begin(), v.end(), mt);
    }
};
RandomNumberGenerator rng;

template <typename T, typename S>
T modpow(T a, S b, T MOD) {
    T ret = 1;
    while (b > 0) {
        if (b & 1) {
            ret *= a;
            ret %= MOD;
        }
        a *= a;
        a %= MOD;
        b >>= 1;
    }
    return ret;
}

bool isPrime(long long n) {
    if (n <= 1)
        return false;
    else if (n == 2)
        return true;
    else if (n % 2 == 0)
        return false;

    long long A[7] = {2, 325, 9375, 28178, 450775, 9780504, 1795265022};
    long long s    = 0;
    long long d    = n - 1;
    while (d % 2 == 0) {
        d /= 2;
        s++;
    }

    for (auto a : A) {
        if (a % n == 0) return true;
        long long x = modpow<__int128_t>(a, d, n);
        if (x != 1) {
            bool ng = true;
            for (int i = 0; i < s; i++) {
                if (x == n - 1) {
                    ng = false;
                    break;
                };
                x = __int128_t(x) * x % n;
            }
            if (ng) return false;
        }
    }
    return true;
}
const bool DEBUG = false;
ll tot           = 0;
ll deno          = 0;
void solve() {
    const int n = 100;
    vec(int, P, n);
    ll cnt = 0;
    iota(all(P), 1);
    rng.shuffle(P);

    map<ll, ll> memo;
    vector<int> Ps = {2, 3, 5, 7};
    auto ask       = [&](int i, int j) -> ll {
        if (memo.count(i * n + j)) return memo[i * n + j];
        if (DEBUG) {
            cnt++;
            int ret                = gcd(P[i], P[j]);
            return memo[i * n + j] = ret;
        }
        assert(i != j);
        if (i > j) swap(i, j);
        print("?", i + 1, j + 1);
        FLUSH();
        INT(ret);
        return memo[i * n + j] = ret;
    };

    vec(int, ind, 4, -1);
    while (min(ind) == -1) {
        int a = rng(n);
        int b = rng(n);
        if (a == b) continue;
        auto res = ask(a, b);
        if (res % 6 == 0) {
            ind[0] = a;
            ind[1] = a;
        }
        if (res % 5 == 0) {
            ind[2] = a;
        }
        if (res % 7 == 0) {
            ind[3] = a;
        }
    }

    vec(int, prod, n, 1);
    fori(i, 4) {
        int p = Ps[i];
        prod[ind[i]] *= p;
        for (int j = 0; j < n; j++) {
            if (ind[i] == j) continue;
            auto res = ask(ind[i], j);
            if (res % p == 0) {
                prod[j] *= p;
            }
        }
    }

    auto create = [&](int x) {
        vector<int> res;
        fori(i, n) {
            if (prod[i] == x) res.push_back(i);
        }
        return res;
    };

    auto one   = create(1);
    auto two   = create(2);
    auto three = create(3);
    auto five  = create(5);
    auto seven = create(7);

    set<int> se;
    for (auto o : one) se.insert(o);

    {
        int four = -1;
        while (four == -1) {
            int a = two[rng(two.size())];
            int b = two[rng(two.size())];
            if (a == b) continue;
            auto res = ask(a, b);
            if (res % 4 == 0) {
                four = a;
                break;
            }
        }
        vector<int> nex_two;
        for (auto t : two) {
            if (t == four) continue;
            auto res = ask(four, t);
            if (res % 4 != 0) {
                nex_two.push_back(t);
            }
        }
        two = nex_two;
    }
    map<int, int> dic;
    {
        vec(bool, used, len(one), false);
        for (auto a : two) {
            vec(int, Q, len(one));
            iota(all(Q), 0);
            rng.shuffle(Q);
            bool ok_ = true;
            for (auto q : Q) {
                if (used[q]) continue;
                auto res = ask(one[q], a);
                if (res != 1) {
                    used[q]  = true;
                    dic[res] = one[q];
                    ok_      = false;
                    break;
                }
            }
            if (ok_) {
                se.insert(a);
            }
        }
    }

    {
        int nine = -1;
        while (nine == -1) {
            int a = three[rng(three.size())];
            int b = three[rng(three.size())];
            if (a == b) continue;
            auto res = ask(a, b);
            if (res % 9 == 0) {
                nine = a;
                break;
            }
        }
        vec(int, nex_three, 0);
        for (auto t : three) {
            if (t == nine) continue;
            auto res = ask(nine, t);
            if (res % 9 != 0) {
                nex_three.push_back(t);
            }
        }
        three               = nex_three;
        vector<int> three_p = {11, 13, 17, 19, 23, 29, 31};
        vec(bool, used, len(three_p), false);
        for (auto t : three) {
            vec(int, Q, len(three_p));
            iota(all(Q), 0);
            rng.shuffle(Q);
            bool ok_ = true;
            for (auto q : Q) {
                if (used[q]) continue;
                int b    = dic[three_p[q]];
                auto res = ask(b, t);
                if (res != 1) {
                    ok_     = false;
                    used[q] = true;
                    break;
                }
            }
            if (ok_) {
                se.insert(t);
                break;
            }
        }
    }
    {
        auto ten = create(10);
        int tf   = -1;
        while (tf == -1) {
            int a = ten[rng(ten.size())];
            int b = ten[rng(ten.size())];
            if (a == b) continue;
            auto res = ask(a, b);
            if (res % 25 == 0) {
                tf = a;
                break;
            }
        }
        vector<int> nex_five;
        for (auto t : five) {
            if (t == tf) continue;
            auto res = ask(tf, t);
            if (res % 25 != 0) {
                nex_five.push_back(t);
            }
        }
        five               = nex_five;
        vector<int> five_p = {11, 13, 17, 19};
        vec(bool, used, len(five_p), false);
        for (auto t : five) {
            vec(int, Q, len(five_p));
            iota(all(Q), 0);
            rng.shuffle(Q);
            bool ok_ = true;
            for (auto q : Q) {
                if (used[q]) continue;
                int b    = dic[five_p[q]];
                auto res = ask(b, t);
                if (res != 1) {
                    ok_     = false;
                    used[q] = true;
                    break;
                }
            }
            if (ok_) {
                se.insert(t);
                break;
            }
        }
    }
    {
        int fn      = -1;
        auto lst_14 = create(14);
        while (fn == -1) {
            int a    = seven[rng(seven.size())];
            int b    = lst_14[rng(lst_14.size())];
            auto res = ask(a, b);
            if (res % 49 == 0) {
                fn = a;
                break;
            }
        }
        vector<int> nex_seven;
        for (auto t : seven) {
            auto res = ask(fn, t);
            if (res % 49 != 0) {
                nex_seven.push_back(t);
            }
        }
        seven = nex_seven;

        vector<int> seven_p = {11, 13};
        vec(bool, used, len(seven_p), false);
        for (auto t : seven) {
            vec(int, Q, len(seven_p));
            iota(all(Q), 0);
            rng.shuffle(Q);
            bool ok_ = true;
            for (auto q : Q) {
                if (used[q]) continue;
                int b    = dic[seven_p[q]];
                auto res = ask(b, t);
                if (res != 1) {
                    ok_     = false;
                    used[q] = true;
                    break;
                }
            }
            if (ok_) {
                se.insert(t);
                break;
            }
        }
    }

    vec(int, ans, n, 0);
    for (auto s : se) ans[s] = 1;

    if (DEBUG) {
        int cc = 0;
        vec(int, pp, 0);
        fori(i, n) {
            if (ans[i] == 1) {
                assert(P[i] == 1 or isPrime(P[i]));
                pp.push_back(P[i]);
                cc++;
            }
        }
        // sort(all(pp));
        // print(pp);
        // print(cnt);
        // print(cc);
        tot += cnt;
        deno++;
        print(tot, deno, double(tot) / deno);
        prispa("!");
        prisep(ans, "");
    } else {
        prispa("!");
        prisep(ans, "");
        FLUSH();
    }
}

int main() {
    cin.tie(0)->sync_with_stdio(0);
    // cout << fixed << setprecision(12);
    int t;
    t = 1000;
    // cin >> t;
    while (t--) solve();
    return 0;
}