#include <bits/stdc++.h>
using namespace std;
const int MOD = 1e9 + 7; // A prime modulus is better
int main() {
ios_base::sync_with_stdio(false);
cin.tie(nullptr);
long long a, b, max1 = 0;
cin >> a;
vector<int> v;
v.reserve(a); // Preallocating space
cin >> b;
max1 = b;
v.push_back(b);
cout << 1 << '\n';
for (int i = 1; i < a; i++) {
cin >> b;
b = (b + v.size()) % MOD;
// Efficiently remove elements greater than b
auto it = lower_bound(v.begin(), v.end(), b);
v.erase(it, v.end());
if (b > max1) {
v.push_back(b);
max1 = b;
}
cout << v.size() << '\n';
}
}
