$Abdulqodir$ cut out $2024$ congruent regular $n-$gons from a sheet of paper and placed these $n-$gons on the table such that some parts of each of these $n-$gons may be covered by others. We say that a vertex of one of the afore-mentioned $n-$gons is $visible$ if it is not in the interior of another $n-$gon that is placed on top of it. For any $n>2$ determine the minimum possible number of visible vertices. Proposed by David Hrushka, Slovakia