#include <bits/stdc++.h>

#define fi first
#define se second
#define DB double
#define U unsigned
#define P std::pair
#define LL long long
#define LD long double
#define pb emplace_back
#define MP std::make_pair
#define SZ(x) ((int)x.size())
#define all(x) x.begin(),x.end()
#define CLR(i,a) memset(i,a,sizeof(i))
#define FOR(i,a,b) for(int i = a;i <= b;++i)
#define ROF(i,a,b) for(int i = a;i >= b;--i)
#define DEBUG(x) std::cerr << #x << '=' << x << std::endl

const int MAXN = 1e5 + 5;
const int MAXM = 5e6 + 5;
const int ha = 998244353;

inline int mod(int x){
    x -= ha;x += x>>31&ha;return x;
}

struct DS1{
    int lc[MAXM],rc[MAXM],val[MAXM],n,tot;

    inline void init(int _){
        FOR(i,0,tot) lc[i] = rc[i] = val[i] = 0;
        n = _;tot = 0;
    }

    inline void update(int &x,int l,int r,int p,int d){
        ++tot;std::tie(lc[tot],rc[tot],val[tot]) = {lc[x],rc[x],val[x]};x = tot;
        if(l == r){
            val[x] = d;
            return;
        }
        int mid = (l + r) >> 1;
        if(p <= mid) update(lc[x],l,mid,p,d);
        else update(rc[x],mid+1,r,p,d);
    }

    inline int update(int x,int p,int d){
        update(x,1,n,p,d);
        return x;
    }

    inline int query(int x,int l,int r,int p){
        if(!x) return -1;
        if(l == r) return val[x];
        int mid = (l + r) >> 1;
        if(p <= mid) return query(lc[x],l,mid,p);
        else return query(rc[x],mid+1,r,p);
    }

    inline int query(int x,int p){
        return query(x,1,n,p);
    }
}T1;

inline int S2(int x){
    if(x&1) return 1ll*x*((x+1)/2)%ha;
    else return 1ll*(x/2)*(x+1)%ha;
}

struct DS2{
    int lc[MAXM],rc[MAXM],sm[MAXM],tag[MAXM],n,tot;

    inline void init(int _){
        FOR(i,0,tot) std::tie(lc[i],rc[i],sm[i],tag[i]) = std::tuple<int,int,int,int>{0,0,0,0};
        n = _;tot = 0;
    }

    inline int New(int x){
        ++tot;std::tie(lc[tot],rc[tot],sm[tot],tag[tot]) = {lc[x],rc[x],sm[x],tag[x]};
        return tot;
    }

    inline void cover(int &x,int l,int r,int d){
        x = New(x);sm[x] = 1ll*(r-l+1)*d%ha;tag[x] = d;
    }

    inline void pushdown(int x,int l,int r){
        if(tag[x]){
            int mid = (l + r) >> 1;
            cover(lc[x],l,mid,tag[x]);
            cover(rc[x],mid+1,r,tag[x]);
            tag[x] = 0;
        }
    }

    inline void modify(int &x,int l,int r,int L,int R,int d){
        x = New(x);
        if(l == L && r == R){
            sm[x] = 1ll*(r-l+1)*d%ha;
            tag[x] = d;
            return;
        }
        int mid = (l + r) >> 1;pushdown(x,l,r);
        if(R <= mid) modify(lc[x],l,mid,L,R,d);
        else if(L > mid) modify(rc[x],mid+1,r,L,R,d);
        else modify(lc[x],l,mid,L,mid,d),modify(rc[x],mid+1,r,mid+1,R,d);
        sm[x] = mod(sm[lc[x]]+sm[rc[x]]);
    }

    inline int modify(int x,int l,int r,int d){
        modify(x,1,n,l,r,d);return x;
    }

    inline int query(int x,int l,int r,int L,int R){
        if(!x) return 0;
        if(l == L && r == R) return sm[x];
        int mid = (l + r) >> 1;pushdown(x,l,r);
        if(R <= mid) return query(lc[x],l,mid,L,R);
        if(L > mid) return query(rc[x],mid+1,r,L,R);
        return mod(query(lc[x],l,mid,L,mid)+query(rc[x],mid+1,r,mid+1,R));
    }

    inline int query(int x,int l,int r){
        return query(x,1,n,l,r);
    }
}T2;

std::vector<P<int,int> > G[MAXN];
int rt[MAXN],ch[MAXN],r2[MAXN][26],mxl[MAXN][26];
int fail[MAXN];
std::map<P<int,int>,int> S;

inline int getid(P<int,int> x){
    if(S.find(x) == S.end()) S[x] = SZ(S)+1;
    return S[x];
}

inline void dfs1(int v,int len=-1,int pos=-1){
    // 注意: 选择根往下的第一个连续段的条件是长度 <=
    // 版本不一样的点之间显然不能连 fail
//    rt[v] = rt[fail[v]];
//    for(auto x:G[v]) rt[v] = T1.update(rt[v],getid({ch[x.fi],x.se}),x.fi);
    for(auto x:G[v]){
        //rt[v] = T1.update(rt[fail[v]],getid({ch[x.fi],x.se}),x.fi); 这个在 v=0会锅
        if(v){
            rt[v] = T1.update(rt[fail[v]],getid({ch[x.fi],x.se}),x.fi);
            fail[x.fi] = std::max(0,T1.query(rt[fail[v]],getid({ch[x.fi],x.se})));
            if(!fail[x.fi] && x.se >= len && ch[x.fi] == ch[pos]) fail[x.fi] = pos;
        }
        if(len == -1) dfs1(x.fi,x.se,x.fi);
        else dfs1(x.fi,len,pos);
    }
}

int ans[MAXN];

inline void dfs2(int v,int len=0,int ll=-1,int pos=-1){
    // 这里也是 不要算别的版本的贡献!
    // 也是要特判开头的那一段...
    memcpy(r2[v],r2[fail[v]],sizeof(r2[v]));
    memcpy(mxl[v],mxl[fail[v]],sizeof(mxl[v]));
    int *rt = r2[v],*mx = mxl[v];
    for(auto x:G[v]){
        if(len){
            int lim = std::min(x.se,mx[ch[x.fi]]);
            if(lim) ans[x.fi] = mod(T2.query(rt[ch[x.fi]],1,lim)+S2(lim-1));
            if(x.se > mx[ch[x.fi]] && ch[pos] == ch[x.fi]){
                ans[x.fi] = mod(ans[x.fi]+1ll*(x.se-mx[ch[x.fi]])*ll%ha);
            }
        }
        else ans[x.fi] = S2(x.se-1);
    }
    for(auto x:G[v]){
        int t1 = rt[ch[x.fi]],t2 = mx[ch[x.fi]];
        rt[ch[x.fi]] = T2.modify(rt[ch[x.fi]],1,x.se,len+1);
        mx[ch[x.fi]] = std::max(mx[ch[x.fi]],x.se);
        ans[x.fi] = mod(ans[x.fi]+ans[v]);
        if(ll == -1) dfs2(x.fi,len+x.se,x.se,x.fi);
        else dfs2(x.fi,len+x.se,ll,pos);
        rt[ch[x.fi]] = t1;mx[ch[x.fi]] = t2;
    }
}

int ps[MAXN];

int main(){
//    freopen("jojo3.in","r",stdin);
//    freopen("jojo.out","w",stdout);
    int n;scanf("%d",&n);
    int now = 0;
    FOR(i,1,n){
        int opt,x;scanf("%d%d",&opt,&x);
        if(opt == 1){
            char c[23];scanf("%s",c);ch[i] = c[0]-'a';
            G[now].pb(i,x);now = i;getid({ch[i],x});
        }
        else{
            now = ps[x];
        }
        ps[i] = now;
    }
    T1.init(SZ(S));
    dfs1(0);
    T2.init(10000);
    dfs2(0);
    FOR(i,1,n) printf("%d\n",ans[ps[i]]);
    return 0;
}