#include <bits/stdc++.h>
using namespace std;
template <class T>
bool ckmin(T& a, const T& b) {
  return b < a ? a = b, 1 : 0;
}
template <class T>
bool ckmax(T& a, const T& b) {
  return a < b ? a = b, 1 : 0;
}
int pct(int x) { return __builtin_popcount(x); }
int bits(int x) { return 31 - __builtin_clz(x); }
int fstTrue(function<bool(int)> first, int lo, int hi) {
  hi++;
  assert(lo <= hi);
  while (lo < hi) {
    int mid = (lo + hi) / 2;
    first(mid) ? hi = mid : lo = mid + 1;
  }
  return lo;
}
const long long MOD = 1e9 + 7;
const int dx[8] = {1, 0, -1, 0, 1, 1, -1, -1},
          dy[8] = {0, 1, 0, -1, -1, 1, -1, 1};
int gcd(int a, int b) { return b ? gcd(b, a % b) : a; }
long long binpow(long long a, long long b) {
  long long res = 1;
  while (b) {
    if (b & 1) res = (res * a) % MOD;
    a = (a * a) % MOD;
    b >>= 1;
  }
  return res;
}
long long modInv(long long a) { return binpow(a, MOD - 2); }
bool sortcol(const vector<long long>& v1, const vector<long long>& v2) {
  return v1[1] < v2[1];
}
bool sortpair(const pair<int, int>& p1, const pair<int, int>& p2) {
  return p1.first < p2.first;
}
mt19937 rng((uint32_t)chrono::steady_clock::now().time_since_epoch().count());
uniform_int_distribution<long long unsigned> distribution(0, 10);
void __print(int x) { cerr << x; }
void __print(long x) { cerr << x; }
void __print(long long x) { cerr << x; }
void __print(unsigned x) { cerr << x; }
void __print(unsigned long x) { cerr << x; }
void __print(unsigned long long x) { cerr << x; }
void __print(float x) { cerr << x; }
void __print(double x) { cerr << x; }
void __print(long double x) { cerr << x; }
void __print(char x) { cerr << '\'' << x << '\''; }
void __print(const char* x) { cerr << '\"' << x << '\"'; }
void __print(const string& x) { cerr << '\"' << x << '\"'; }
void __print(bool x) { cerr << (x ? "true" : "false"); }
template <typename T, typename V>
void __print(const pair<T, V>& x) {
  cerr << '{';
  __print(x.first);
  cerr << ',';
  __print(x.second);
  cerr << '}';
}
template <typename T>
void __print(const T& x) {
  int first = 0;
  cerr << '{';
  for (auto& i : x) cerr << (first++ ? "," : ""), __print(i);
  cerr << "}";
}
void _print() { cerr << "]\n"; }
template <typename T, typename... V>
void _print(T t, V... v) {
  __print(t);
  if (sizeof...(v)) cerr << ", ";
  _print(v...);
}
const int mxN = 2e5 + 5;
int n, ans[105];
pair<int, int> res[105];
int get(int x) {
  int ret = 0;
  while (ret * (ret + 1) / 2 < x) ret++;
  return ret;
}
void solve() {
  cin >> n;
  cin >> res[n].first >> res[n].second;
  for (int i = (n)-1; i >= (0); i--) {
    if (i <= 1)
      cout << "+ " << i + 1 << "\n";
    else if (i == 2)
      cout << "+ 1\n";
    else
      cout << "+ " << i << "\n";
    cout.flush();
    cin >> res[i].first >> res[i].second;
  }
  ans[0] = get(res[0].first - res[1].first);
  ans[2] = res[0].second - res[1].second - res[2].second + res[3].second - 1;
  ans[1] = (res[2].second - res[3].second) / (ans[2] + 1);
  ans[3] = (res[1].second - res[2].second - (ans[0] + 1) * (ans[2] + 1)) /
               (ans[2] + 1) -
           1;
  if (n == 4) ans[3]++;
  for (int i = (0); i < (n - 4); i++) {
    ans[i + 4] = (res[i + 3].second - res[i + 4].second - ans[i] * ans[i + 1] -
                  ans[i + 1] * (ans[i + 3] + 1)) /
                     (ans[i + 3] + 1) -
                 1;
    if (i == n - 5) ans[i + 4]++;
  }
  cout << "! ";
  for (int i = (0); i < (n); i++) cout << ans[i] << " \n"[i == n - 1];
  cout.flush();
}
int main() {
  ios::sync_with_stdio(0);
  cin.tie(0);
  int tc = 1;
  while (tc--) solve();
}
