#include <bits/stdc++.h>
using namespace std;
template <typename T>
bool MinPlace(T &a, const T &b) {
  if (a > b) {
    a = b;
    return true;
  }
  return false;
}
template <typename T>
bool MaxPlace(T &a, const T &b) {
  if (a < b) {
    a = b;
    return true;
  }
  return false;
}
template <typename S, typename T>
ostream &operator<<(ostream &out, const pair<S, T> &p) {
  out << "{" << p.first << ", " << p.second << "}";
  return out;
}
template <typename T>
ostream &operator<<(ostream &out, const vector<T> &v) {
  out << "[";
  for (int i = 0; i < (int)v.size(); i++) {
    out << v[i];
    if (i != (int)v.size() - 1) out << ", ";
  }
  out << "]";
  return out;
}
int get_pa(int i, vector<int> &refer) {
  return i < 0 || refer[i] == i ? i : refer[i] = get_pa(refer[i], refer);
}
int main() {
  ios_base::sync_with_stdio(0);
  cin.tie(0);
  cout.tie(0);
  ;
  int n;
  cin >> n;
  char ch;
  vector<int> val(2 * n, 0);
  vector<int> take(n + 1, 0);
  set<int> empty;
  for (int i = 0; i < 2 * n; i++) {
    cin >> ch;
    if (ch != '+') {
      cin >> val[i];
      take[val[i]] = i;
      val[i] = -val[i];
    } else
      empty.insert(i);
  }
  empty.insert(2 * n);
  for (int i = 1; i <= n; i++) {
    auto itr = empty.lower_bound(take[i]);
    if (itr == empty.begin()) {
      cout << "NO\n";
      return 0;
    } else {
      int pos = *(--itr);
      val[pos] = i;
      empty.erase(pos);
    }
  }
  set<int> avl;
  for (int i = 0; i < 2 * n; i++) {
    if (val[i] > 0)
      avl.insert(val[i]);
    else {
      if (!avl.size() || -val[i] != *avl.begin()) {
        cout << "NO\n";
        return 0;
      }
      avl.erase(avl.begin());
    }
  }
  cout << "YES\n";
  for (int i = 0; i < 2 * n; i++)
    if (val[i] > 0) cout << val[i] << " ";
}
