#include <bits/stdc++.h>
#include <atcoder/all>
using namespace std;
using namespace atcoder;
//using mint = modint1000000007;
//const int mod = 1000000007;
using mint = modint998244353;
const int mod = 998244353;
//const int INF = 1e9;
//const long long LINF = 1e18;
#define rep(i, n) for (int i = 0; i < (n); ++i)
#define rep2(i,l,r)for(int i=(l);i<(r);++i)
#define rrep(i, n) for (int i = (n-1); i >= 0; --i)
#define rrep2(i,l,r)for(int i=(r-1);i>=(l);--i)
#define all(x) (x).begin(),(x).end()
#define allR(x) (x).rbegin(),(x).rend()
#define endl "\n"
#define P pair<int,int>
template<typename A, typename B> inline bool chmax(A & a, const B & b) { if (a < b) { a = b; return true; } return false; }
template<typename A, typename B> inline bool chmin(A & a, const B & b) { if (a > b) { a = b; return true; } return false; }
vector<int>to[200005];
mint dp[200005][2];
void dfs(int v, int d = 0, int p = -1) {
	vector<mint>sub = { 1,0,0 };
	for (int e : to[v]) {
		if (p == e) continue;
		dfs(e, d + 1, v);
		vector<mint>tmp(3);
		rep(i, 3) rep(j, 2) {
			int k = i + 1 - j;
			if (k > 3)continue;
			tmp[k] += dp[e][j] * sub[i];
		}
		swap(sub, tmp);
	}
	dp[v][0] = sub[0] + sub[1];
	dp[v][1] = sub[1] + sub[2];
	///cout << dp[v][0].val() << " " << dp[v][1].val() << endl;
}
int main() {
	ios::sync_with_stdio(false);
	cin.tie(nullptr);
	int n; cin >> n;
	rep(i, n - 1) {
		int u, v; cin >> u >> v; u--, v--;
		to[u].push_back(v);
		to[v].push_back(u);
	}
	dfs(0);
	cout << dp[0][1].val() << endl;
	return 0;
}