#include <bits/stdc++.h>
using namespace std;
typedef long long LL;
constexpr int N = 2e5;
constexpr int mod = 998244353;
int n;
class graph {
	private:
	int idx;
	public:
	int head[N + 5];
	struct edge {
		int nxt, v;
	} e[(N << 1) + 5];
	constexpr void add_dir(int u, int v) {
		e[++idx] = {head[u], v};
		head[u] = idx;
	}
	constexpr void add_udir(int u, int v) {
		add_dir(u, v), add_dir(v, u);
	}
} G;
int f[N + 5], g[N + 5];
void dfs(int u, int fa = 0) {
	f[u] = g[u] = 1;
	for (int i = G.head[u]; i; i = G.e[i].nxt) {
		int v = G.e[i].v;
		if (v == fa) continue;
		dfs(v, u);
		int p = ((LL)f[u] * f[v] + (LL)f[u] * g[v] + (LL)g[u] * f[v]) % mod,
		q = ((LL)g[u] * f[v] + (LL)g[u] * g[v]) % mod;
		f[u] = p, g[u] = q;
	}
}
int main() {
	scanf("%d", &n);
	for (int _ = 1; _ < n; _++) {
		int u, v;
		scanf("%d%d", &u, &v);
		G.add_udir(u, v);
	}
	dfs(1);
	printf("%d\n", f[1]);
	return 0;
}