#include <bits/stdc++.h>
using namespace std;
const int N = 2e5 + 7;
const int INF = 1e9 + 7;
int n;
int tp[N], v[N], id[N], f[N], w[N];
int ff(int x) { return (f[x] == x) ? x : f[x] = ff(f[x]); }
int main() {
  scanf("%d", &n);
  for (int i = 1; i <= 2 * n; i++) {
    char s[5];
    scanf("%s", s);
    if (s[0] == '+')
      tp[i] = 1;
    else {
      tp[i] = 2;
      int x;
      scanf("%d", &x);
      id[x] = i;
      v[i] = x;
    }
    f[i] = i;
  }
  for (int i = 1; i <= n; i++) {
    int t = ff(id[i] - 1);
    if (!t) {
      puts("NO");
      return 0;
    }
    if (tp[t] == 2) {
      puts("NO");
      return 0;
    }
    w[t] = i;
    f[t] = t - 1;
    f[id[i]] = id[i] - 1;
  }
  puts("YES");
  for (int i = 1; i <= 2 * n; i++)
    if (tp[i] == 1) printf("%d ", w[i]);
  puts("");
  return 0;
}
