#include <bits/stdc++.h>
using namespace std;

constexpr int mod = 998244353;

long long modpow(long long a,long long b) {
    long long ans = 1;
    while(b) {
        if(b & 1) {
            (ans *= a) %= mod;
        }
        (a *= a) %= mod;
        b /= 2;
    }
    return ans;
}

void dfs(int n,int p,vector<vector<int>>&ki,vector<vector<int>>&dp) {
    dp[n][0] = 1;
    for(int i:ki[n]) {
        if(i == p) {
            continue;
        }
        dfs(i,n,ki,dp);
        vector<int>nxt(3);
        for(int j = 0; j < 3; j++) {
            nxt[j] += 1ll*dp[n][j]*(dp[i][1]+dp[i][2])%mod;
            if(nxt[j] >= mod) nxt[j] -= mod;
            if(j != 2) {
                nxt[j+1] += 1ll*dp[n][j]*(dp[i][0]+dp[i][1])%mod;
                if(nxt[j+1] >= mod) nxt[j+1] -= mod;
            }
        }
        dp[n] = nxt;
    }
}

int main() {
    int N;
    cin >> N;
    vector<vector<int>>ki(N);
    for(int i = 0; i < N-1; i++) {
        int u,v;
        cin >> u >> v;
        u--;
        v--;
        ki[u].push_back(v);
        ki[v].push_back(u);
    }
    vector<vector<int>>dp(N,vector<int>(3));
    dfs(0,-1,ki,dp);
    cout << (dp[0][1]+dp[0][2])%mod << endl;
}