#include <bits/stdc++.h>
using namespace std;
using ll = long long;
using P = pair<ll,ll>;
#define fix(x) fixed << setprecision(x)
#define asc(x) x, vector<x>, greater<x>
#define rep(i, n) for(ll i = 0; i < n; i++)
#define all(x) (x).begin(),(x).end()
template<class T>bool chmin(T&a, const T&b){if(a>b){a=b;return 1;}return 0;}
template<class T>bool chmax(T&a, const T&b){if(a<b){a=b;return 1;}return 0;}
const ll MOD = 998244353;
int n;
vector<vector<int>> to(100100);
vector<ll> dp(int par, int now){
    vector<ll> res(3,0);
    res[0] = 1;
    for(int x:to[now]){
        if(x==par) continue;
        vector<ll> upd(3), info = dp(now,x);
        rep(i,3) upd[i] = res[i] * (info[1] + info[2]) % MOD;
        rep(i,2) upd[i+1] = (upd[i+1] + res[i] * (info[0]+info[1])) % MOD;
        res = upd;
    }
    return res;
}
int main(){
    cin.tie(nullptr);
    ios::sync_with_stdio(false);
    cin >> n;
    rep(i,n-1){
        int u,v;
        cin >> u >> v;
        u--; v--;
        to[u].push_back(v);
        to[v].push_back(u);
    }
    auto x = dp(-1,0);
    cout << (x[1]+x[2])%MOD << '\n';
    return 0;
}