MOD = 998244353
 
# Function to find the number of cycles in the permutation
def find_cycles(n, perm):
    visited = [False] * (n + 1)
    cycles = 0
 
    for i in range(1, n + 1):
        if not visited[i]:
            j = i
            while not visited[j]:
                visited[j] = True
                j = perm[j]
            cycles += 1
 
    return cycles
 
# Function to calculate factorial modulo MOD
def factorial_mod(n):
    result = 1
    for i in range(2, n + 1):
        result = (result * i) % MOD
    return result
 
# Main function to solve the problem
def count_permutations(t, test_cases):
    for i in range(t):
        n, perm = test_cases[i]
        cycles = find_cycles(n, perm)
        permutations = factorial_mod(cycles)
        print(permutations)
 
# Read input
t = int(input())
test_cases = []
for _ in range(t):
    n = int(input())
    perm = list(map(int, input().split()))
    test_cases.append((n, perm))
 
# Solve the problem
count_permutations(t, test_cases)