#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<mint,mint>
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<vector<int>>to;
P dfs(int v, int d = 0, int p = -1) {
	if ((-1 != p) && (1 == to[v].size()))return { 1,1 };
	vector<P>vec;
	for (int e : to[v]) {
		if (p == e) continue;
		auto get = dfs(e, d + 1, v);
		vec.push_back(get);
	}
	int sz = vec.size();
	vector<mint>l(sz + 1), r(sz + 1);
	l[0] = 1, r[sz] = 1;
	rep(i, sz)l[i + 1] = l[i] * (vec[i].first + vec[i].second);
	rrep(i, sz)r[i] = r[i + 1] * (vec[i].first + vec[i].second);
	P ret = { l[sz],l[sz] };
	rep(i, sz) ret.first += l[i] * r[i + 1] * vec[i].first;
	return ret;
}

int main() {
	ios::sync_with_stdio(false);
	cin.tie(nullptr);
	int n; cin >> n;
	to.resize(n);
	rep(i, n - 1) {
		int a, b; cin >> a >> b;
		a--, b--;
		to[a].push_back(b);
		to[b].push_back(a);
	}
	auto ans = dfs(0);
	cout << ans.first.val() << endl;
	return 0;
}