#include <bits/stdc++.h>
#pragma GCC optimize("Ofast")
#pragma GCC target("sse4")
using namespace std;
constexpr long long mod = 1000000007;
const long long INF = mod * mod;
const double eps = 1e-12;
const double pi = acosl(-1.0);
long long mod_pow(long long x, long long n, long long m = mod) {
  long long res = 1;
  while (n) {
    if (n & 1) res = res * x % m;
    x = x * x % m;
    n >>= 1;
  }
  return res;
}
struct modint {
  long long n;
  modint() : n(0) { ; }
  modint(long long m) : n(m) {
    if (n >= mod)
      n %= mod;
    else if (n < 0)
      n = (n % mod + mod) % mod;
  }
  operator int() { return n; }
};
bool operator==(modint a, modint b) { return a.n == b.n; }
modint operator+=(modint& a, modint b) {
  a.n += b.n;
  if (a.n >= mod) a.n -= mod;
  return a;
}
modint operator-=(modint& a, modint b) {
  a.n -= b.n;
  if (a.n < 0) a.n += mod;
  return a;
}
modint operator*=(modint& a, modint b) {
  a.n = ((long long)a.n * b.n) % mod;
  return a;
}
modint operator+(modint a, modint b) { return a += b; }
modint operator-(modint a, modint b) { return a -= b; }
modint operator*(modint a, modint b) { return a *= b; }
modint operator^(modint a, long long n) {
  if (n == 0) return modint(1);
  modint res = (a * a) ^ (n / 2);
  if (n % 2) res = res * a;
  return res;
}
long long inv(long long a, long long p) {
  return (a == 1 ? 1 : (1 - p * inv(p % a, a)) / a + p);
}
modint operator/(modint a, modint b) { return a * modint(inv(b, mod)); }
const int max_n = 1 << 10;
modint fact[max_n], factinv[max_n];
void init_f() {
  fact[0] = modint(1);
  for (int i = 0; i < max_n - 1; i++) {
    fact[i + 1] = fact[i] * modint(i + 1);
  }
  factinv[max_n - 1] = modint(1) / fact[max_n - 1];
  for (int i = max_n - 2; i >= 0; i--) {
    factinv[i] = factinv[i + 1] * modint(i + 1);
  }
}
modint comb(int a, int b) {
  if (a < 0 || b < 0 || a < b) return 0;
  return fact[a] * factinv[b] * factinv[a - b];
}
long long gcd(long long a, long long b) {
  a = abs(a);
  b = abs(b);
  if (a < b) swap(a, b);
  while (b) {
    long long r = a % b;
    a = b;
    b = r;
  }
  return a;
}
struct SegT {
 private:
  int n;
  vector<long long> node, lazy;
  const long long init_c = -INF;

 public:
  SegT(int sz) {
    n = 1;
    while (n < sz) n <<= 1;
    node.resize(2 * n - 1, init_c);
    lazy.resize(2 * n - 1, 0);
  }
  long long f(long long a, long long b) { return max(a, b); }
  void eval(int k) {
    node[k] += lazy[k];
    if (k < n - 1) {
      lazy[2 * k + 1] += lazy[k];
      lazy[2 * k + 2] += lazy[k];
    }
    lazy[k] = 0;
  }
  void add(long long x, int a, int b, int k = 0, int l = 0, int r = -1) {
    if (r < 0) r = n;
    eval(k);
    if (r <= a || b <= l) return;
    if (a <= l && r <= b) {
      lazy[k] += x;
      eval(k);
    } else {
      add(x, a, b, k * 2 + 1, l, (l + r) / 2);
      add(x, a, b, k * 2 + 2, (l + r) / 2, r);
      node[k] = f(node[k * 2 + 1], node[k * 2 + 2]);
    }
  }
  long long query(int a, int b, int k = 0, int l = 0, int r = -1) {
    if (r < 0) r = n;
    eval(k);
    if (r <= a || b <= l) return init_c;
    if (a <= l && r <= b)
      return node[k];
    else {
      long long vl = query(a, b, k * 2 + 1, l, (l + r) / 2);
      long long vr = query(a, b, k * 2 + 2, (l + r) / 2, r);
      return f(vl, vr);
    }
  }
  void update(int loc, long long x) {
    int k = 0, l = 0, r = n;
    stack<pair<int, int> > st;
    while (k < n - 1) {
      eval(k);
      st.push({l, r});
      if (loc < (l + r) / 2) {
        k = 2 * k + 1;
        r = (l + r) / 2;
      } else {
        k = 2 * k + 2;
        l = (l + r) / 2;
      }
    }
    eval(k);
    st.push({l, r});
    node[k] = x;
    while (k > 0) {
      k = (k - 1) / 2;
      st.pop();
      l = st.top().first, r = st.top().second;
      eval(2 * k + 1);
      eval(2 * k + 2);
      node[k] = f(node[2 * k + 1], node[2 * k + 2]);
    }
  }
  int find_over0(int le) {
    int k = 0, l = 0, r = n;
    while (k < n - 1) {
      eval(k);
      int m = (l + r) / 2;
      if (le < m) {
        k = 2 * k + 1;
        r = m;
      } else {
        k = 2 * k + 2;
        l = m;
      }
    }
    eval(k);
    if (node[k] > 0) return le;
    while (k > 0) {
      int pre = k;
      k = (k - 1) / 2;
      if (2 * k + 1 == pre) {
        eval(2 * k + 2);
        if (node[2 * k + 2] > 0) {
          k = 2 * k + 2;
          break;
        }
      }
    }
    if (k == 0) return n;
    while (k < n - 1) {
      eval(2 * k + 1);
      eval(2 * k + 2);
      if (node[2 * k + 1] > 0)
        k = 2 * k + 1;
      else
        k = 2 * k + 2;
    }
    return k - (n - 1);
  }
  int query() {
    int res = 0;
    int s = 0;
    while (s < n) {
      s = find_over0(s);
      if (s >= n) break;
      res++;
      s++;
    }
    return res;
  }
};
struct BIT {
 private:
  vector<long long> node;
  int n;

 public:
  BIT(int n_) {
    n = n_;
    node.resize(n, 0);
  }
  void add(int a, long long w) {
    for (int i = a; i < n; i |= i + 1) node[i] += w;
  }
  long long sum(int a) {
    long long ret = 0;
    for (int i = a - 1; i >= 0; i = (i & (i + 1)) - 1) ret += node[i];
    return ret;
  }
  long long sum(int a, int b) { return sum(b) - sum(a); }
};
void solve() {
  int n;
  cin >> n;
  vector<char> c(n);
  vector<int> x(n);
  vector<pair<int, int> > v;
  vector<pair<int, int> > vm;
  for (int i = 0; i < n; i++) {
    cin >> c[i] >> x[i];
    if (c[i] == '+')
      v.push_back({x[i], i});
    else {
      vm.push_back({x[i], i});
    }
  }
  sort((v).begin(), (v).end());
  sort((vm).begin(), (vm).end());
  vector<int> trans(n);
  int loc = 0;
  for (int i = 0; i < v.size(); i++) {
    while (loc < vm.size() && vm[loc].first < v[i].first) loc++;
    if (loc < vm.size() && vm[loc].first == v[i].first) {
      trans[vm[loc].second] = i;
      loc++;
    }
  }
  SegT st(v.size());
  BIT bt(v.size());
  for (int i = 0; i < v.size(); i++) trans[v[i].second] = i;
  int num = 0;
  for (int i = 0; i < n; i++) {
    int id = trans[i];
    if (c[i] == '+') {
      num++;
      st.update(id, x[i] - 2 * bt.sum(id));
      st.add(-2 * x[i], id + 1, v.size());
      bt.add(id, x[i]);
    } else {
      num--;
      bt.add(id, -x[i]);
      st.update(id, -INF);
      st.add(2 * x[i], id + 1, v.size());
    }
    int ans = 0;
    if (num > 0) {
      ans = num - st.query();
    }
    cout << ans << "\n";
  }
}
signed main() {
  ios::sync_with_stdio(false);
  cin.tie(0);
  solve();
  return 0;
}
