In the article, we deal with the problem of determining the number of ways in which it is possible to renumber the sides of precisely n-regular convex polyhedra of the same type, so that the probability of obtaining any possible sum of spots on these solids is the same (while neither two of these solids have the same numbering scheme) as on n "classically" numbered solids of the same type.