Vrijeme: 02:02

Mentorski snovi | Dreams of five mentors #3

U Mislavovom snu ovčice su jako nestašne i uopće ga ne slušaju.
Stvari su pogoršane činjenicom da ih ima 2023 što je Mislavu jako teško za čuvati.
Ali Mislav je odlučan i odlučio je poredati ovce u vrstu. Prvo je numerirao ovce brojevima od 1 do 2023 kako bi ih razlikovao.
Onda ih je posložio u vrstu tako da točno jedna ovca koja se nalazi na mjestu i u vrsti ima na sebi napisan broj koji je veći od ovce na mjestu i+1.
Ovo je ovce privremeno umirilo, no to nije potrajalo, stoga je Mislav svaki put kada bi izgubio kontrolu poredao ovce na drugačiji način koristeći isto pravilo.
Na koliko je maksimalno različitih načina Mislav mogao poredati ovce?

S obzirom da je rezultat velik napišite ga modulo 10^9+7 (smijete koristiti programski jezik po volji kako bi to izračunali)
In Mislav's dream, the sheep are very naughty and do not listen to him at all.
Things are made worse by the fact that there are 2023 of them, which is very difficult for Mislav to keep.
But Mislav is determined and decided to sort the sheep into a series. First, he numbered the sheep with numbers from 1 to 2023 to distinguish them.
Then he arranged them in a series so that exactly one sheep located at position i in the series has a number written on it that is greater than the sheep at position i+1.
This calmed the sheep temporarily, but it did not last, so every time Mislav lost control, he arranged the sheep in a different way using the same rule.
In how many different ways could Mislav arrange the sheep?

Given that the result is large, write it modulo 10^9+7 (you can use any programming language you like to calculate it)