https://atcoder.jp/contests/abc298/tasks/abc298_d
/*
coder:sunshine
school:njupt
*/
#include <bits/stdc++.h>
using namespace std;
#define endl '\n' //交互题删掉
#define x first
#define y second
typedef long long ll;
typedef pair<int, int> pii;
constexpr int mod = 998244353;
constexpr int N = 6e5 + 10;
ll p[N], s[N], l, r = 1, ans;
int main()
{
ios::sync_with_stdio(false);
cin.tie(nullptr);
cout.tie(nullptr);
int q;
cin >> q;
ans = 1;
p[0] = 1;
s[0] = 1;
for (int i = 1; i <= 6e5; i++)
p[i] = p[i - 1] * 10 % mod;
while (q--)
{
int ty;
cin >> ty;
if (ty == 1)
{
int a;
cin >> a;
s[r++] = a;
ans = (ans * 10 + a) % mod;
}
else if (ty == 2)
{
ans = ((ans - p[r - l - 1] * s[l]) % mod + mod) % mod;
l++;
}
else
{
cout << ans << endl;
}
}
return 0;
}