from collections import defaultdict, deque
from sys import stdin

MOD = 998244353

def main():
    N = int(stdin.readline())
    S = list(map(int, stdin.readline().split()))
    initial = defaultdict(int)
    for num in S:
        initial[num] += 1

    visited = set()
    queue = deque()

    # Initialize state as tuple of sorted elements with counts
    initial_tuple = frozenset(initial.items())
    visited.add(initial_tuple)
    queue.append(initial)

    count = 1  # Initial state is counted

    while queue:
        current = queue.popleft()

        # Generate all possible non-empty subsets (in terms of set elements)
        elements = list(current.keys())
        m = len(elements)
        all_subset_elements = []
        from itertools import combinations
        for k in range(1, m + 1):
            for combo in combinations(elements, k):
                all_subset_elements.append(set(combo))
        all_subset_elements.append(set())

        for subset_set in all_subset_elements:
            if not subset_set:
                continue  # No empty subsets allowed

            mex = 0
            while mex in subset_set:
                mex += 1

            new_current = defaultdict(int, current)
            for num in subset_set:
                new_current[num] -= 1
                if new_current[num] == 0:
                    del new_current[num]
            new_current[mex] += 1

            # Create a normalized state representation
            normalized = frozenset(new_current.items())
            if normalized not in visited:
                visited.add(normalized)
                count += 1
                if count >= MOD:
                    count -= MOD
                queue.append(new_current)

    print(count % MOD)

if __name__ == '__main__':
    main()