Double Factorial

Given a positive integer, its double factorial, denoted by \( n!! \), is defined as the product of all positive integers not exceeding \( n \) that have the same parity as \( n \). For example:

• \( 3!! = 3 \times 1 = 3 \)
• \( 8!! = 8 \times 6 \times 4 \times 2 = 384 \)
• \( 11!! = 11 \times 9 \times 7 \times 5 \times 3 \times 1 = 10395 \)

Your task is to compute the last 5 decimal digits of \( 2021!! \), i.e. the value of \( 2021!! \) modulo \( 10^5 \). Note that for an odd number \( n \), \[ 2021!! = 2021 \times 2019 \times \cdots \times 5 \times 3 \times 1 \,. \]

This is a result-fill problem. You do not need to process any input; just output the computed integer result. Extra text in the output will be considered wrong.

inputFormat

There is no input for this problem.

outputFormat

Output a single integer: the last 5 digits of \( 2021!! \) (i.e. \( 2021!! \) modulo \( 10^5 \)).

sample

59375