#include <bits/stdc++.h>
using namespace std;
#define ll long long

const ll mod=998244353;
ll N;
vector<ll>G[1<<17];
ll dp[1<<17][3];

void dfs(ll u,ll p)
{
	ll a=1,b=0,c=0;
	for(ll v:G[u])if(v!=p)
	{
		dfs(v,u);
		ll na=a*(dp[v][0]+dp[v][1])%mod;
        ll nb=( b*(dp[v][0]+dp[v][1])+a*(dp[v][1]+dp[v][2]) )%mod;
		ll nc=( c*(dp[v][0]+dp[v][1])+b*(dp[v][1]+dp[v][2]) )%mod;
		a=na,b=nb,c=nc;
	}
	dp[u][0]=c;
	dp[u][1]=b;
	dp[u][2]=a;
}

int main()
{
	cin>>N;
	for(ll i=1;i<N;i++)
	{
		ll u,v;
		cin>>u>>v;
		G[u].push_back(v);
		G[v].push_back(u);
	}
	dfs(1,0);
	cout<<(dp[1][0]+dp[1][1])%mod <<endl;
}