#include <bits/stdc++.h>
using namespace std;
const double pi = acos(0.0) * 2.0;
const long double eps = 1e-10;
const int step[8][2] = {{-1, 0}, {0, 1}, {1, 0},  {0, -1},
                        {-1, 1}, {1, 1}, {1, -1}, {-1, -1}};
template <class T>
inline T abs1(T a) {
  return a < 0 ? -a : a;
}
template <typename t, typename t1>
t min1(t a, t1 b) {
  return a < b ? a : b;
}
template <typename t, typename... arg>
t min1(t a, arg... arr) {
  return min1(a, min1(arr...));
}
template <typename t, typename t1>
t max1(t a, t1 b) {
  return a > b ? a : b;
}
template <typename t, typename... arg>
t max1(t a, arg... arr) {
  return max1(a, max1(arr...));
}
inline int jud(double a, double b) {
  if (abs(a) < eps && abs(b) < eps)
    return 0;
  else if (abs1(a - b) / max(abs1(a), abs1(b)) < eps)
    return 0;
  if (a < b) return -1;
  return 1;
}
template <typename t>
inline int jud(t a, t b) {
  if (a < b) return -1;
  if (a == b) return 0;
  return 1;
}
template <typename it, typename t1>
inline int find(t1 val, it a, int na, bool f_small = 1, bool f_lb = 1) {
  if (na == 0) return 0;
  int be = 0, en = na - 1;
  if (*a <= *(a + na - 1)) {
    if (f_lb == 0)
      while (be < en) {
        int mid = (be + en + 1) / 2;
        if (jud(*(a + mid), val) != 1)
          be = mid;
        else
          en = mid - 1;
      }
    else
      while (be < en) {
        int mid = (be + en) / 2;
        if (jud(*(a + mid), val) != -1)
          en = mid;
        else
          be = mid + 1;
      }
    if (f_small && jud(*(a + be), val) == 1) be--;
    if (!f_small && jud(*(a + be), val) == -1) be++;
  } else {
    if (f_lb)
      while (be < en) {
        int mid = (be + en + 1) / 2;
        if (jud(*(a + mid), val) != -1)
          be = mid;
        else
          en = mid - 1;
      }
    else
      while (be < en) {
        int mid = (be + en) / 2;
        if (jud(*(a + mid), val) != 1)
          en = mid;
        else
          be = mid + 1;
      }
    if (!f_small && jud(*(a + be), val) == -1) be--;
    if (f_small && jud(*(a + be), val) == 1) be++;
  }
  return be;
}
template <class T>
inline T lowb(T num) {
  return num & (-num);
}
inline int bitnum(unsigned int nValue) { return __builtin_popcount(nValue); }
inline int bitnum(int nValue) { return __builtin_popcount(nValue); }
inline int bitnum(unsigned long long nValue) {
  return __builtin_popcount(nValue) + __builtin_popcount(nValue >> 32);
}
inline int bitnum(long long nValue) {
  return __builtin_popcount(nValue) + __builtin_popcount(nValue >> 32);
}
inline int bitmaxl(unsigned int a) {
  if (a == 0) return 0;
  return 32 - __builtin_clz(a);
}
inline int bitmaxl(int a) {
  if (a == 0) return 0;
  return 32 - __builtin_clz(a);
}
inline int bitmaxl(unsigned long long a) {
  int temp = a >> 32;
  if (temp) return 32 - __builtin_clz(temp) + 32;
  return bitmaxl(int(a));
}
inline int bitmaxl(long long a) {
  int temp = a >> 32;
  if (temp) return 32 - __builtin_clz(temp) + 32;
  return bitmaxl(int(a));
}
long long pow(long long n, long long m, long long mod = 0) {
  if (m < 0) return 0;
  long long ans = 1;
  long long k = n;
  while (m) {
    if (m & 1) {
      ans *= k;
      if (mod) ans %= mod;
    }
    k *= k;
    if (mod) k %= mod;
    m >>= 1;
  }
  return ans;
}
template <class t1, class t2>
inline void add(t1 &a, t2 b, int mod = -1) {
  if (mod == -1) mod = 1000000007;
  a += b;
  while (a >= mod) a -= mod;
  while (a < 0) a += mod;
}
template <class t>
void output1(t arr) {
  for (int i = 0; i < (int)arr.size(); i++) cerr << arr[i] << ' ';
  cerr << endl;
}
template <class t>
void output2(t arr) {
  for (int i = 0; i < (int)arr.size(); i++) output1(arr[i]);
}
const int maxn = 500100;
template <class t>
struct segment_node {
  int be, en;
  t maxv, add, sum;
};
segment_node<long long> tree[500100 * 4];
template <class t>
struct segment_tree {
  int l;
  inline int gleft(int no) { return no << 1; }
  inline int gright(int no) { return (no << 1) + 1; }
  inline int gfa(int no) { return no >> 1; }
  inline segment_tree() { l = 0; }
  void build(int no, int l, int r, t orig = 0, t *a = NULL) {
    if (l > r) r = l;
    if (l == r) {
      tree[no].be = tree[no].en = l;
      tree[no].add = 0;
      if (a == NULL)
        tree[no].maxv = orig;
      else
        tree[no].maxv = a[l];
      tree[no].add = 0;
      tree[no].sum = tree[no].maxv;
      return;
    }
    tree[no].be = l;
    tree[no].en = r;
    int mid = (l + r) / 2;
    build(gleft(no), l, mid, orig, a);
    build(gright(no), mid + 1, r, orig, a);
    tree[no].sum = tree[gleft(no)].sum + tree[gright(no)].sum;
    tree[no].add = 0;
    tree[no].maxv = max1(tree[gleft(no)].maxv, tree[gright(no)].maxv);
  }
  inline void relax(int no) {
    int le = gleft(no), ri = gright(no);
    tree[le].add += tree[no].add;
    tree[le].sum += tree[no].add * (tree[le].en - tree[le].be + 1);
    tree[le].maxv += tree[no].add;
    tree[ri].add += tree[no].add;
    tree[ri].sum += tree[no].add * (tree[ri].en - tree[ri].be + 1);
    tree[ri].maxv += tree[no].add;
    tree[no].add = 0;
  }
  void down(int l, int r, int no, t ranadd) {
    if (l <= tree[no].be && r >= tree[no].en) {
      tree[no].add += ranadd;
      tree[no].sum += ranadd * (tree[no].en - tree[no].be + 1);
      tree[no].maxv += ranadd;
      return;
    }
    if (tree[no].add && tree[no].be != tree[no].en) relax(no);
    int mid = (tree[no].be + tree[no].en) >> 1;
    if (r >= tree[no].be && l <= mid) down(l, r, gleft(no), ranadd);
    if (r >= mid + 1 && l <= tree[no].en) down(l, r, gright(no), ranadd);
    tree[no].sum = tree[gleft(no)].sum + tree[gright(no)].sum;
    tree[no].maxv = max1(tree[gleft(no)].maxv, tree[gright(no)].maxv);
  }
  int getsum(int no) {
    if (tree[no].add && tree[no].be != tree[no].en) relax(no);
    if (tree[no].be == tree[no].en) return 1;
    t ans = 0;
    if (tree[gleft(no)].maxv > 0) ans += getsum(gleft(no));
    if (tree[gright(no)].maxv > 0) ans += getsum(gright(no));
    return ans;
  }
};
segment_tree<long long> sgt;
set<pair<int, int> > s;
int n;
pair<int, int> orig[maxn];
int q[maxn];
int rk[maxn];
int nq;
int main() {
  ios_base::sync_with_stdio(0);
  scanf("%d", &nq);
  for (int i = 0; i < nq; i++) {
    char str[2];
    scanf("%s%d", str, q + i);
    if (str[0] == '-')
      q[i] = -q[i];
    else
      orig[n++] = make_pair(q[i], i);
  }
  sort(orig, orig + n);
  for (int i = 0; i < n; i++) rk[orig[i].second] = i;
  sgt.build(1, 0, n);
  for (int i = 0; i < nq; i++) {
    if (q[i] > 0) {
      s.insert(make_pair(q[i], i));
      sgt.down(rk[i], rk[i], 1, (q[i] + 1) / 2);
      sgt.down(rk[i] + 1, n, 1, -q[i]);
    } else {
      auto it = s.lower_bound(make_pair(-q[i], -1));
      sgt.down(rk[it->second], rk[it->second], 1, (q[i] - 1) / 2);
      sgt.down(rk[it->second] + 1, n, 1, -q[i]);
      s.erase(it);
    }
    printf("%d\n", max(0, (int)s.size() - (int)sgt.getsum(1)));
  }
  return 0;
}
