#include <bits/stdc++.h>
using namespace std;
const int N = 1e6 + 7;
const long long mod = 1e9 + 7;
mt19937 rng(chrono::steady_clock::now().time_since_epoch().count());
int n;
int b[N];
int a[N];
int ans[N];
int main() {
  ios_base::sync_with_stdio(0);
  cin.tie(0);
  cout.tie(0);
  cin >> n;
  n += n;
  set<int> s;
  for (int i = 1; i <= n / 2; i++) {
    s.insert(i);
  }
  int cnt = 0;
  deque<int> v;
  for (int i = 1; i <= n; i++) {
    char c;
    cin >> c;
    if (c == '+') {
      cnt += 1;
      v.push_back(i);
    } else {
      cin >> a[i];
      int x = a[i];
      if (cnt == 0) {
        cout << "NO";
        return 0;
      }
      ans[v.back()] = x;
      s.erase(x);
      v.pop_back();
    }
  }
  set<int> t;
  for (int i = 1; i <= n; i++) {
    if (ans[i] > 0) {
      t.insert(ans[i]);
    } else {
      if (*t.begin() != a[i]) {
        cout << "NO";
        return 0;
      }
      t.erase(t.begin());
    }
  }
  cout << "YES\n";
  for (int i = 1; i <= n; i++) {
    if (ans[i] > 0) {
      cout << ans[i] << " ";
    }
  }
}
