#include <bits/stdc++.h>
using namespace std;
using ll = long long;
using pll = pair<ll, ll>;
#define drep(i, cc, n) for (ll i = (cc); i <= (n); ++i)
#define rep(i, n) drep(i, 0, n - 1)
#define all(a) (a).begin(), (a).end()
#define pb push_back
#define fi first
#define se second

const ll MOD = 1000000007;
const ll MOD2 = 998244353;
const ll INF = 1LL << 60;
const ll MAX_N = 2e5;

ll pow_mod(ll x, ll n, ll mod){
    ll ret = 1;
    while(n > 0){
        if(n & 1) ret = (ret*x)%mod;
        x = x*x%mod;
        n >>=1;
    }
    return ret;
}

vector<vector<ll>> T;
vector<vector<ll>> dp;
void dfs(ll u, ll p){
    for(ll v : T[u]){
        if(v == p) continue;
        dfs(v, u);
    }

    ll sum = 1;
    for(ll v : T[u]){
        if(v == p) continue;
        sum *= (dp[v][0]+dp[v][1])%MOD2;
        sum %= MOD2;
    }

    dp[u][1] = sum;
    for(ll v : T[u]){
        if(v == p) continue;
        dp[u][0] *= (dp[v][0]+dp[v][1])%MOD2;
        dp[u][0] %= MOD2;
        ll s = (sum * pow_mod((dp[v][0]+dp[v][1])%MOD2, MOD2-2, MOD2))%MOD2;
        dp[u][1] += (s*dp[v][1])%MOD2;
        dp[u][1] %= MOD2;
    }

    return;
}

int main(){
    cin.tie(nullptr);
    ios::sync_with_stdio(false);
    
    ll n; cin >> n;
    T.resize(n);
    rep(i, n-1){
        ll a, b;
        cin >> a >> b;
        a--; b--;
        T[a].pb(b); T[b].pb(a);
    }

    dp.resize(n, vector<ll>(2, 1));
    dfs(0, -1);
    cout << dp[0][1] << endl;
}