#include <bits/stdc++.h>
using namespace std;
const int maxn = 112;
int n, a[maxn], b[maxn], ans[maxn], rc[maxn * maxn], tail;
void ask(int x) {
  cout << "+ " << x << endl;
  tail--;
  cin >> a[tail] >> b[tail];
}
void answer() {
  cout << '!';
  for (int(i) = (1); (i) <= (n); (i)++) cout << ' ' << ans[i];
  cout << endl;
}
int main() {
  cin >> n;
  cin >> a[n + 1] >> b[n + 1];
  for (int(i) = (0); (i) <= ((n + 1) - 1); (i)++) rc[i * (i + 1) / 2] = i + 1;
  tail = n + 1;
  for (int(i) = (2); (i) <= (n - 2); (i)++) ask(i);
  ask(n);
  ask(n - 1);
  ask(n);
  ans[n] = rc[a[1] - a[2]] - 1;
  ans[n - 2] = b[1] - b[2] - b[3] + b[4] - 1;
  ans[n - 1] = (b[1] - b[2]) / (ans[n - 2] + 1) - 1;
  ans[n - 3] = (b[2] - b[3]) / (ans[n - 2] + 1) - ans[n] - 1;
  if (n > 4) ans[n - 3]--;
  for (int(i) = (n - 4); (i) >= (1); (i)--) {
    ans[i] =
        (b[n - i] - b[n - i + 1] - ans[i + 3] * ans[i + 4]) / (ans[i + 1] + 1) -
        ans[i + 3];
    if (i != 1) ans[i]--;
  }
  answer();
}
