How will the N-fold run through a polyalphabetic encryption algorithm affect the cryptographic strength?

Question

Cryptography

Suppose there is an algorithm that uses the principle of polyalphabetic encryption. How much will it affect the strength of an encrypted message by running through the same algorithm of an encrypted message from 2 to N times?

Answer 1

Depends on the number of these very "alphabets". If the replacement table is compiled correctly, then after one run the statistical characteristics will be aligned and subsequent encryptions will be useless.
Clarifying question: Will the second and further encryption be carried out by the same replacement table?