1.3. At the Faculty of Mechanics and Mathematics of Moscow State University, there are $n$ female students and $2 n-1$ male students (both female and male students are numbered). It is known that the $k$-th female student is acquainted with male students numbered from 1 to $2 k-1$. How many ways are there to form $n$ pairs, each consisting of an acquainted male and female student?

## Second Round