mod = 998244353


def main():
    import sys
    input = sys.stdin.readline
    from collections import deque

    N = int(input())
    adj = [[] for _ in range(N+1)]
    for _ in range(N-1):
        a, b = map(int, input().split())
        adj[a].append(b)
        adj[b].append(a)

    que = deque()
    que.append(1)
    seen = [-1] * (N+1)
    seen[1] = 0
    par = [0] * (N+1)
    child = [[] for _ in range(N+1)]
    seq = []
    while que:
        v = que.popleft()
        seq.append(v)
        for u in adj[v]:
            if seen[u] == -1:
                seen[u] = seen[v] + 1
                par[u] = v
                child[v].append(u)
                que.append(u)
    seq.reverse()

    dp0 = [0] * (N+1)
    dp1 = [0] * (N+1)
    for v in seq:
        dp0[v] = 1
        dp1[v] = 1
        dp10 = 1
        dp11 = 0
        for u in child[v]:
            dp0[v] = (dp0[v] * (dp0[u] + dp1[u]) % mod) % mod
            dp10, dp11 = (dp10 * (dp0[u] + dp1[u]) % mod) % mod, ((dp11 * (dp0[u] + dp1[u]) % mod) % mod + (dp10 * dp1[u]) % mod) % mod
        if child[v]:
            dp1[v] = (dp11 + dp0[v]) % mod
    print(dp1[1])


if __name__ == '__main__':
    main()