#include<bits/stdc++.h>
namespace {
#pragma GCC diagnostic ignored "-Wunused-function"
#include<atcoder/all>
#pragma GCC diagnostic warning "-Wunused-function"
using namespace std;
using namespace atcoder;
#define rep(i,n) for(int i = 0; i < (int)(n); i++)
#define rrep(i,n) for(int i = (int)(n) - 1; i >= 0; i--)
#define all(x) begin(x), end(x)
#define rall(x) rbegin(x), rend(x)
template<class T> bool chmax(T& a, const T& b) { if (a < b) { a = b; return true; } else return false; }
template<class T> bool chmin(T& a, const T& b) { if (b < a) { a = b; return true; } else return false; }
using ll = long long;
using P = pair<int,int>;
using VI = vector<int>;
using VVI = vector<VI>;
using VL = vector<ll>;
using VVL = vector<VL>;
using mint = modint998244353;

} int main() {
  ios::sync_with_stdio(false);
  cin.tie(0);
  int n;
  cin >> n;
  VVI to(n);
  rep(_, n - 1) {
    int a, b;
    cin >> a >> b;
    a--, b--;
    to[a].emplace_back(b);
    to[b].emplace_back(a);
  }
  auto dfs = [&](auto self, int u, int p) -> array<mint, 2> {
    array<mint, 2> dp{1, 0};
    for(int v: to[u]) if (v != p) {
      auto d = self(self, v, u);
      array<mint, 2> ndp;
      rep(i, 2) rep(j, 2) if (i + j < 2) ndp[i + j] += dp[i] * d[j];
      dp = ndp;
    }
    dp[1] += dp[0];
    dp[0] += dp[1];
    return dp;
  };
  mint ans = dfs(dfs, 0, -1)[1];
  cout << ans.val() << '\n';
}