#include <bits/stdc++.h>
#pragma GCC optimize("Ofast", "unroll-loops", "omit-frame-pointer", "inline")
#pragma GCC option("arch=native", "tune=native", "no-zero-upper")
#pragma GCC target("avx2")
using namespace std;
template <typename T>
void maxtt(T &t1, T t2) {
  t1 = max(t1, t2);
}
template <typename T>
void mintt(T &t1, T t2) {
  t1 = min(t1, t2);
}
bool debug = 0;
int n, m, k;
string direc = "RDLU";
const long long MOD2 = (long long)998244353 * (long long)998244353;
long long ln, lk, lm;
void etp(bool f = 0) {
  puts(f ? "YES" : "NO");
  exit(0);
}
void addmod(int &x, int y, int mod = 998244353) {
  x += y;
  if (x >= mod) x -= mod;
  if (x < 0) x += mod;
  assert(x >= 0 && x < mod);
}
void et(int x = -1) {
  printf("%d\n", x);
  exit(0);
}
long long fastPow(long long x, long long y, int mod = 998244353) {
  long long ans = 1;
  while (y > 0) {
    if (y & 1) ans = (x * ans) % mod;
    x = x * x % mod;
    y >>= 1;
  }
  return ans;
}
long long gcd1(long long x, long long y) { return y ? gcd1(y, x % y) : x; }
void rd(int x, int &a, int &b) {
  printf("+ %d\n", x);
  fflush(stdout);
  scanf("%d%d", &a, &b);
}
int a[135], b[135];
int ans[135];
int ckd(long long x) {
  for (int(i) = 1; (i) <= (int)(101); (i)++)
    if (i * (i - 1) == x * 2) return i;
  return -1;
}
int cal(int a, int b, int c, int S) { return (S - a * b - b * c) / c; }
void fmain(int tid) {
  scanf("%d", &n);
  scanf("%d%d", a + n, b + n);
  for (int i = n - 1; i >= 3; i--) {
    rd(i, a[i], b[i]);
  }
  rd(1, a[1], b[1]);
  rd(2, a[2], b[2]);
  int x, y;
  rd(1, x, y);
  x -= a[2];
  y -= b[2];
  ans[1] = ckd(x) - 1;
  int p = b[1] - b[3];
  int q = y;
  ans[3] = q - p - 1;
  ans[2] = p / (ans[3] + 1);
  ans[4] = cal(0, ans[1] + 1, ans[3] + 1, b[2] - b[1]) - 1;
  if (n == 4) ans[4]++;
  for (int i = 5; i <= n; i++) {
    int j = i - 2;
    ans[i] = cal(ans[j - 2], ans[j - 1], ans[j + 1] + 1, b[j] - b[j + 1]) - 1;
    if (i == n) ans[i]++;
  }
  printf("!");
  for (int(i) = 1; (i) <= (int)(n); (i)++) printf(" %d", ans[i]);
  puts("");
}
int main() {
  int t = 1;
  for (int(i) = 1; (i) <= (int)(t); (i)++) {
    fmain(i);
  }
  return 0;
}
