MOD = 998244353

n = int(input())
edges = [[] for _ in range(n)]
for _ in range(n - 1):
    u, v = map(int, input().split())
    u -= 1
    v -= 1
    edges[u].append(v)
    edges[v].append(u)

stack = [0]
route = [0]
used = [False] * n
used[0] = True
while stack:
    pos = stack.pop()
    for npos in edges[pos]:
        if used[npos]:
            continue
        used[npos] = True
        stack.append(npos)
        route.append(npos)

dp1 = [0] * n
dp2 = [0] * n

used = [False] * n
for pos in route[::-1]:
    used[pos] = True
    dp = [1, 0, 0]
    for npos in edges[pos]:
        if not used[npos]:
            continue
        ndp = [0] * 3
        ndp[0] = dp[0] * dp1[npos] % MOD
        ndp[1] = (dp[1] * dp1[npos] + dp[0] * dp2[npos]) % MOD
        ndp[2] = (dp[2] * dp1[npos] + dp[1] * dp2[npos]) % MOD
        dp = ndp
    dp1[pos] = (dp[1] + dp[2]) % MOD
    dp2[pos] = (dp[0] + dp[1]) % MOD

print(dp1[0])