#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 u, v;
    cin >> u >> v;
    u--;
    v--;
    E[u].push_back(v);
    E[v].push_back(u);
  }
  vector<int> p(N, -1);
  vector<vector<int>> c(N);
  queue<int> Q;
  Q.push(0);
  vector<int> bfs;
  while (!Q.empty()){
    int v = Q.front();
    Q.pop();
    bfs.push_back(v);
    for (int w : E[v]){
      if (w != p[v]){
        p[w] = v;
        c[v].push_back(w);
        Q.push(w);
      }
    }
  }
  reverse(bfs.begin(), bfs.end());
  vector<vector<long long>> dp(3, vector<long long>(N, 0));
  for (int v : bfs){
    int cnt = c[v].size();
    vector<vector<long long>> dp2(3, vector<long long>(cnt + 1, 0));
    dp2[0][0] = 1;
    for (int i = 0; i < cnt; i++){
      int w = c[v][i];
      dp2[1][i + 1] += dp2[0][i] * dp[0][w];
      dp2[2][i + 1] += dp2[1][i] * dp[0][w];
      dp2[0][i + 1] += dp2[0][i] * dp[1][w];
      dp2[1][i + 1] += dp2[1][i] * dp[1][w];
      dp2[2][i + 1] += dp2[2][i] * dp[1][w];
      dp2[1][i + 1] += dp2[0][i] * dp[1][w];
      dp2[2][i + 1] += dp2[1][i] * dp[1][w];
      dp2[0][i + 1] += dp2[0][i] * dp[2][w];
      dp2[1][i + 1] += dp2[1][i] * dp[2][w];
      dp2[2][i + 1] += dp2[2][i] * dp[2][w];
      dp2[0][i + 1] %= MOD;
      dp2[1][i + 1] %= MOD;
      dp2[1][i + 1] %= MOD;
    }
    for (int i = 0; i < 3; i++){
      dp[i][v] = dp2[i][cnt];
    }
  }
  cout << (dp[1][0] + dp[2][0]) % MOD << endl;
}