#include <bits/stdc++.h>
using namespace std;
const long long MOD = 998244353;
int main(){
  int N;
  cin >> N;
  vector<vector<int>> E(N);
  for (int i = 0; i < N - 1; i++){
    int A, B;
    cin >> A >> B;
    A--;
    B--;
    E[A].push_back(B);
    E[B].push_back(A);
  }
  vector<int> p(N, -1);
  vector<vector<int>> c(N);
  vector<int> b;
  queue<int> Q;
  Q.push(0);
  while (!Q.empty()){
    int v = Q.front();
    Q.pop();
    b.push_back(v);
    for (int w : E[v]){
      if (w != p[v]){
        p[w] = v;
        c[v].push_back(w);
        Q.push(w);
      }
    }
  }
  reverse(b.begin(), b.end());
  vector<long long> dp1(N, 0), dp2(N, 0);
  for (int v : b){
    int cnt = c[v].size();
    vector<vector<long long>> dp(2, vector<long long>(cnt + 1, 0));
    dp[0][0] = 1;
    dp[1][0] = 1;
    for (int i = 0; i < cnt; i++){
      int w = c[v][i];
      dp[0][i + 1] += dp[0][i] * (dp1[w] + dp2[w]) % MOD;
      dp[0][i + 1] %= MOD;
      dp[1][i + 1] += dp[0][i] * dp2[w] % MOD;
      dp[1][i + 1] += dp[1][i] * (dp1[w] + dp2[w]) % MOD;
      dp[1][i + 1] %= MOD;
    }
    dp1[v] = dp[0][cnt];
    dp2[v] = dp[1][cnt];
  }
  cout << dp2[0] << endl;
}