#include <bits/stdc++.h>
using namespace std;
const int NN = 202020;
int ans[NN];
int t[NN], val[NN], pos[NN];
int main() {
  int n;
  cin >> n;
  set<int> st;
  for (int i = 1; i <= 2 * n; i++) {
    char c;
    scanf(" %c", &c);
    if (c == '+') {
      t[i] = 1;
      st.insert(i);
    } else {
      int p;
      scanf(" %d", &p);
      t[i] = 2;
      val[i] = p;
      pos[p] = i;
    }
  }
  st.insert(-1);
  for (int i = 1; i <= n; i++) {
    int u = *--st.lower_bound(pos[i]);
    if (u == -1) {
      puts("NO");
      return 0;
    }
    ans[u] = i;
    st.erase(u);
  }
  set<int> wk;
  wk.insert(1e9);
  for (int i = 1; i <= 2 * n; i++) {
    if (t[i] == 1) {
      wk.insert(ans[i]);
    } else {
      int u = *wk.begin();
      wk.erase(u);
      if (u != val[i]) {
        puts("NO");
        return 0;
      }
    }
  }
  puts("YES");
  for (int i = 1; i <= 2 * n; i++)
    if (t[i] == 1) printf("%d ", ans[i]);
  return 0;
}
