#include <bits/stdc++.h>
using namespace std;
long long int MOD = 998244353;
long long int MX = 4000000000000000000;
long long int INF = 1e17;
long long int query[200][2];
long long int res[200];
long long int n;
int main() {
  ios::sync_with_stdio(false), cin.tie(NULL), cout.tie(NULL);
  scanf("%lld", &n);
  scanf("%lld%lld", &query[0][0], &query[0][1]);
  for (int i = n - 1; i >= 3; i--) {
    printf("+ %d\n", i);
    fflush(stdout);
    scanf("%lld%lld", &query[n - i][0], &query[n - i][1]);
  }
  printf("+ 1\n");
  fflush(stdout);
  scanf("%lld%lld", &query[n - 2][0], &query[n - 2][1]);
  printf("+ 2\n");
  fflush(stdout);
  scanf("%lld%lld", &query[n - 1][0], &query[n - 1][1]);
  printf("+ 1\n");
  fflush(stdout);
  scanf("%lld%lld", &query[n][0], &query[n][1]);
  for (int i = n; i >= 1; i--) {
    query[i][0] -= query[i - 1][0];
    query[i][1] -= query[i - 1][1];
  }
  res[1] = sqrt(query[n][0] * 2);
  res[3] = query[n][1] - query[n - 2][1] - 1;
  res[2] = query[n - 2][1] / (res[3] + 1);
  res[4] = query[n - 1][1] / (res[3] + 1) - res[1] - 2;
  for (int i = 3; i <= n - 2; i++) {
    res[i + 2] =
        (query[n - i][1] - res[i - 2] * res[i - 1]) / (res[i + 1] + 1) -
        res[i - 1] - 1;
  }
  res[n]++;
  printf("!");
  for (int i = 1; i <= n; i++) printf(" %lld", res[i]);
  printf("\n");
  fflush(stdout);
  return 0;
}
