#include <bits/stdc++.h>
using namespace std;
long long mod(long long a, long long b) {
  if (a % b < 0) {
    return a % b + b;
  }
  return a % b;
}
long long mod_exp(long long a, long long b, long long c) {
  long long res = 1;
  a = a % c;
  while (b > 0) {
    if (b % 2 == 1) {
      res = (res * a) % c;
    }
    b /= 2;
    a = (a * a) % c;
  }
  return res;
}
long long mymod(long long a, long long b) { return ((a % b) + b) % b; }
bool prime[200001];
void SieveOfEratosthenes() {
  memset(prime, true, sizeof(prime));
  prime[1] = false;
  for (int p = 2; p * p <= 200000; p++) {
    if (prime[p] == true) {
      for (int i = p * p; i <= 200000; i += p) prime[i] = false;
    }
  }
  return;
}
long long powe[200005];
void power() {
  powe[0] = 1;
  for (long long i = 1; i < 200005; i++) {
    powe[i] = mymod(2 * powe[i - 1], 1000000007);
  }
}
long long gcdExtended(long long, long long, long long *, long long *);
long long modInverse(long long a, long long m) {
  long long x, y;
  long long g = gcdExtended(a, m, &x, &y);
  long long res = (x % m + m) % m;
  return res;
}
long long gcdExtended(long long a, long long b, long long *x, long long *y) {
  if (a == 0) {
    *x = 0, *y = 1;
    return b;
  }
  long long x1, y1;
  long long gcd = gcdExtended(b % a, a, &x1, &y1);
  *x = y1 - (b / a) * x1;
  *y = x1;
  return gcd;
}
long long n;
struct node {
  vector<long long> adj;
  long long dist[3];
};
void query(long long a) { cout << "+ " << a << endl; }
long long findans(long long a) {
  if (a == 0) {
    return 0;
  }
  for (long long i = 1; i < 105; i++) {
    if ((i * (i + 1)) / 2 == a) {
      return i;
    }
  }
}
int main() {
  ios_base::sync_with_stdio(false);
  cin.tie(NULL);
  cout.tie(NULL);
  long long n;
  cin >> n;
  long long input1[n + 1], input2[n + 1];
  cin >> input1[0] >> input2[0];
  for (long long i = 1; i < n - 2; i++) {
    query(n - i);
    cin >> input1[i] >> input2[i];
  }
  query(1);
  cin >> input1[n - 2] >> input2[n - 2];
  query(2);
  cin >> input1[n - 1] >> input2[n - 1];
  query(1);
  cin >> input1[n] >> input2[n];
  vector<long long> ans(n + 1);
  ans[1] = findans(input1[n] - input1[n - 1]);
  ans[3] = (input2[n] - input2[n - 1] - input2[n - 2] + input2[n - 3] - 1);
  ans[2] = (input2[n - 2] - input2[n - 3]) / (ans[3] + 1);
  ans[4] = (input2[n - 1] - input2[n - 2]) / (ans[3] + 1) - ans[1] - 2;
  for (long long i = 5; i < n + 1; i++) {
    ans[i] = ((input2[n + 2 - i] - input2[n + 1 - i]) -
              ans[i - 4] * ans[i - 3] - ans[i - 3] * (ans[i - 1] + 1)) /
                 (ans[i - 1] + 1) -
             1;
  }
  ans[n]++;
  cout << "! ";
  for (long long i = 1; i < n + 1; i++) {
    cout << ans[i] << " ";
  }
  cout << "\n";
  return 0;
}
