import sys,random,bisect
from collections import deque,defaultdict
from heapq import heapify,heappop,heappush
from itertools import permutations
from math import gcd
from fractions import Fraction

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):
    a,b = mi()
    edge[a-1].append(b-1)
    edge[b-1].append(a-1)

parent = [-1] * N
topo = []
deq = deque([0])
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] for v in range(N)]
for v in topo[::-1]:
    dp[v] = [1,1]
    for nv in edge[v]:
        if nv == parent[v]:
            continue

        a,b = dp[v]
        c,d = dp[nv]

        ndp = [0,0]

        """
        つなげる場合
        """
        ndp[0] += a * c % mod
        ndp[1] += b * c % mod + a * d % mod

        """
        つなげない場合
        """
        ndp[0] += a * (d) % mod
        ndp[1] += b * (d) % mod

        ndp[0] %= mod
        ndp[1] %= mod

        dp[v] = ndp


print(dp[0][1])