#include <bits/stdc++.h>
using namespace std;
const int mod = 998244353;
struct fastio {
  char s[100000];
  int it, len;
  fastio() { it = len = 0; }
  inline char get() {
    if (it < len) return s[it++];
    it = 0;
    len = fread(s, 1, 100000, stdin);
    if (len == 0)
      return EOF;
    else
      return s[it++];
  }
  bool notend() {
    char c = get();
    while (c == ' ' || c == '\n') c = get();
    if (it > 0) it--;
    return c != EOF;
  }
} _buff;
inline long long getnum() {
  long long r = 0;
  bool ng = 0;
  char c;
  c = _buff.get();
  while (c != '-' && (c < '0' || c > '9')) c = _buff.get();
  if (c == '-') ng = 1, c = _buff.get();
  while (c >= '0' && c <= '9') r = r * 10 + c - '0', c = _buff.get();
  return ng ? -r : r;
}
template <class T>
inline void putnum(T x) {
  if (x < 0) putchar('-'), x = -x;
  register short a[20] = {}, sz = 0;
  while (x) a[sz++] = x % 10, x /= 10;
  if (sz == 0) putchar('0');
  for (int i = sz - 1; i >= 0; i--) putchar('0' + a[i]);
}
inline char getreal() {
  char c = _buff.get();
  while (c <= 32) c = _buff.get();
  return c;
}
long long qpow(long long x, long long k) {
  return k == 0 ? 1
                : 1ll * qpow(1ll * x * x % mod, k >> 1) * (k & 1 ? x : 1) % mod;
}
const int maxn = 300111;
int n;
vector<int> con[maxn];
int dp[maxn][3];
void upd(int &x, int v) { x = x + v >= mod ? x + v - mod : x + v; }
void dfs(int x, int pre) {
  int a[4] = {1, 0, 0};
  for (int i = 0; i < con[x].size(); i++) {
    int u = con[x][i];
    if (u == pre) continue;
    dfs(u, x);
    int na[4] = {};
    for (int t = 0; t < 3; t++) {
      upd(na[max(t, 1)], 1ll * a[t] * dp[u][1] % mod);
      if (t != 2) upd(na[2], 1ll * a[t] * dp[u][2] % mod);
      upd(na[t], 1ll * a[t] * dp[u][0] % mod);
    }
    swap(na, a);
  }
  dp[x][1] = (a[2]) % mod;
  dp[x][2] = (a[1] + a[0]) % mod;
  dp[x][0] = (a[0] + a[2]) % mod;
}
int main() {
  n = getnum();
  for (int i = 1; i < n; i++) {
    int x, y;
    x = getnum(), y = getnum();
    con[x].push_back(y);
    con[y].push_back(x);
  }
  dfs(1, -1);
  cout << dp[1][0] << endl;
  return 0;
}
