#include <bits/stdc++.h>
using namespace std;
const int N = 2e5 + 10, size = 1 << 20, mod = 998244353, inf = 2e9;
const long long INF = 1e15;
template <class o>
void qr(o& x) {
  char c = getchar();
  x = 0;
  int f = 1;
  while (!isdigit(c)) {
    if (c == '-') f = -1;
    c = getchar();
  }
  while (isdigit(c)) x = x * 10 + c - '0', c = getchar();
  x *= f;
}
template <class o>
void qw(o x) {
  if (x / 10) qw(x / 10);
  putchar(x % 10 + '0');
}
template <class o>
void pr1(o x) {
  if (x < 0) x = -x, putchar('-');
  qw(x);
  putchar(' ');
}
template <class o>
void pr2(o x) {
  if (x < 0) x = -x, putchar('-');
  qw(x);
  putchar('\n');
}
long long gcd(long long a, long long b) { return !a ? b : gcd(b % a, a); }
long long lcm(long long a, long long b) { return a / gcd(a, b) * b; }
long long power(long long a, long long b = mod - 2, long long p = mod) {
  long long c = 1;
  while (b) {
    if (b & 1) c = c * a % p;
    b /= 2;
    a = a * a % p;
  }
  return c;
}
template <class o>
void cmax(o& x, o y) {
  if (x < y) x = y;
}
void cmax(int& x, int y) {
  x = x - y >> 31 ? y : x;
  ;
}
template <class o>
void cmin(o& x, o y) {
  if (x > y) x = y;
}
void cmin(int& x, int y) { x = x - y >> 31 ? x : y; }
template <typename t1, typename t2>
void ad(t1& x, t2 y) {
  x += y;
  if (x >= mod) x -= mod;
}
template <typename t1, typename t2>
void dl(t1& x, t2 y) {
  x -= y;
  if (x < 0) x += mod;
}
int n, a[N], pos[N];
int op[N], v[N];
set<int> S;
void solve() {
  qr(n);
  char s[5];
  for (int i = 1; i <= n * 2; i++) {
    scanf("%s", s);
    op[i] = s[0] == '+';
    if (!op[i])
      qr(v[i]), pos[v[i]] = i;
    else
      S.insert(i);
  }
  for (int i = 1; i <= n; i++) {
    int p = pos[i];
    auto it = --S.lower_bound(p);
    v[*it] = i;
    S.erase(it);
  }
  for (int i = 1; i <= n * 2; i++) {
    if (op[i])
      S.insert(v[i]);
    else {
      if (S.empty() || *S.begin() != v[i]) {
        puts("NO");
        exit(0);
      }
      S.erase(S.begin());
    }
  }
  puts("YES");
  for (int i = 1; i <= 2 * n; i++) {
    if (op[i]) pr1(v[i]);
  }
}
int main() {
  int T = 1;
  while (T--) solve();
  return 0;
}
