import sys,random,bisect
from collections import deque,defaultdict,Counter
from heapq import heapify,heappop,heappush
from itertools import cycle, permutations
from math import log,gcd

input = lambda :sys.stdin.readline().rstrip()
mi = lambda :map(int,input().split())
li = lambda :list(mi())

mod = 998244353

N = int(input())
edge = [[] for v in range(N)]
for _ in range(N-1):
    u,v = mi()
    edge[u-1].append(v-1)
    edge[v-1].append(u-1)

parent = [-1] * N
deq = deque([0])
topo = []
while deq:
    v = deq.popleft()
    topo.append(v)
    for nv in edge[v]:
        if nv == parent[v]:
            continue
        parent[nv] = v
        deq.append(nv)

dp = [[0,0,0] for v in range(N)]

"""
0:根が1点のみ
1:根がパスの端点
2:根がパスの中
"""

for v in topo[::-1]:
    a,b,c = 1,0,0
    for nv in edge[v]:
        if nv == parent[v]:
            continue

        c = (b * (dp[nv][1] + dp[nv][0]) + c * (dp[nv][1] + dp[nv][2])) % mod
        b = (a * (dp[nv][1]+dp[nv][0]) + b * (dp[nv][1] + dp[nv][2])) % mod
        a = a * (dp[nv][1] + dp[nv][2]) % mod
    
    dp[v] = [a,b,c]

res = dp[0][1] + dp[0][2]

print(res % mod)