#include <bits/stdc++.h>
using namespace std;
const int INF = 0x3f3f3f3f;
const long long LINF = 0x3f3f3f3f3f3f3f3f;
const int MOD = 1e9 + 7;
int dir[8][2] = {-1, 0, 1, 0, 0, -1, 0, 1, -1, -1, -1, 1, 1, -1, 1, 1};
template <typename S, typename T>
inline bool Min(S &a, const T &b) {
  return a > b ? a = b, true : false;
}
template <typename S, typename T>
inline bool Max(S &a, const T &b) {
  return a < b ? a = b, true : false;
}
template <typename S, typename T>
inline void Adm(S &a, const T &b) {
  a = (a + b) % MOD;
  if (a < 0) a += MOD;
}
template <typename T>
inline bool IsPri(T x) {
  if (x < 2) return false;
  for (T i = 2; i * i <= x; ++i)
    if (x % i == 0) return false;
  return true;
}
template <typename T>
inline T _Gcd(T a, T b) {
  while (b) {
    T t = b;
    b = a % b;
    a = t;
  }
  return a;
}
template <typename T>
inline int _BitCnt(T x) {
  int cnt = 0;
  while (x) ++cnt, x &= x - 1;
  return cnt;
}
inline long long Pow(long long a, long long n) {
  long long t = 1;
  a %= MOD;
  while (n > 0) {
    if (n & 1) t = t * a % MOD;
    a = a * a % MOD, n >>= 1;
  }
  return t % MOD;
}
inline int read() {
  static char buf[1000000], *p1 = buf, *p2 = buf;
  register int x = false;
  register char ch =
      p1 == p2 && (p2 = (p1 = buf) + fread(buf, 1, 1000000, stdin), p1 == p2)
          ? EOF
          : *p1++;
  ;
  register bool sgn = false;
  while (ch != '-' && (ch < '0' || ch > '9'))
    ch = p1 == p2 && (p2 = (p1 = buf) + fread(buf, 1, 1000000, stdin), p1 == p2)
             ? EOF
             : *p1++;
  ;
  if (ch == '-')
    sgn = true,
    ch = p1 == p2 && (p2 = (p1 = buf) + fread(buf, 1, 1000000, stdin), p1 == p2)
             ? EOF
             : *p1++;
  ;
  while (ch >= '0' && ch <= '9')
    x = (x << 1) + (x << 3) + (ch ^ 48),
    ch = p1 == p2 && (p2 = (p1 = buf) + fread(buf, 1, 1000000, stdin), p1 == p2)
             ? EOF
             : *p1++;
  ;
  return sgn ? -x : x;
}
int n;
long long ans[110];
long long a[110], b[110];
map<long long, int> mp;
long long calc(long long x) { return x * (x - 1) * (x - 2) / 3 / 2; }
void solve() {
  if (a[n] - a[n - 1]) ans[1] = 1;
  for (int i = 1; i < n; ++i)
    if (a[i] - a[i - 1]) ans[i] = mp[a[i] - a[i - 1]] - 1;
  long long tot = 0;
  for (int i = 2; i < n; ++i) {
    long long s = b[i] - b[i - 1];
    if (i > 2) {
      s -= (ans[i - 1] + 1) * (ans[i - 2] + 1);
      tot += (ans[i] + 1) * (ans[i - 1] + 1) * (ans[i - 2] + 1);
    }
    if (s) Max(ans[i + 1], 1);
  }
  ans[n] = (b[n - 1] - tot) / (ans[n - 1] + 1) / (ans[n - 2] + 1);
  if (b[n] - b[n - 1] != (ans[2] + 1) * (ans[3] + 1)) return;
  for (int i = 1; i < n; ++i) {
    long long s = 0;
    if (i > 2) s += (ans[i - 2] + 1) * (ans[i - 1] + 1);
    if (i > 1 && i < n) s += (ans[i - 1] + 1) * ans[i + 1];
    if (i + 1 < n) s += ans[i + 1] * ans[i + 2];
    if (s != b[i] - b[i - 1]) return;
  }
  printf("!");
  for (int i = 1; i <= n; ++i) printf(" %lld", ans[i]);
  printf("\n"), fflush(stdout);
  exit(0);
}
int main() {
  for (int i = 3; i <= 1000; ++i) mp[calc(i) - calc(i - 1)] = i;
  cin >> n >> a[0] >> b[0];
  for (int i = 1; i < n; ++i) {
    printf("+ %d\n", i), fflush(stdout);
    scanf("%lld%lld", &a[i], &b[i]);
  }
  printf("+ %d\n", 1), fflush(stdout);
  scanf("%lld%lld", &a[n], &b[n]);
  for (int i = 0; i < 2; ++i)
    memset((ans), (0), sizeof(ans)), ans[2] = i, solve();
  return 0;
}
