



lowerCamelCase__			= 'Tobias Carryer'

from time import time






class    SCREAMING_SNAKE_CASE			:

							'''simple docstring'''





							def __init__(   self		:		str      ,				__lowercase		:		Optional[Any]      ,				__lowercase		:		Dict      ,				__lowercase		:		List[str]      ,				__lowercase		:		str=int(time()	)	):  # noqa: B008

											'''simple docstring'''
											__a       =		multiplier
											__a       =		increment
											__a       =		modulo
											__a       =		seed







							def 						UpperCamelCase_					(   self		:		int	):

											'''simple docstring'''
											__a       =		(self.multiplier * self.seed + self.increment) % self.modulo
											return self.seed


if __name__ == "__main__":
						# Show the LCG in action.
						lowerCamelCase__			= LinearCongruentialGenerator(166_4525, 10_1390_4223, 2 << 31)
						while True:
												print(lcg.next_number())





import itertools
import string
from collections.abc import Generator, Iterable

def   lowerCAmelCase__						(							_SCREAMING_SNAKE_CASE       :			Iterable[str]				,     _SCREAMING_SNAKE_CASE       :			int    ):
				"""simple docstring"""







				__a       =		iter(_SCREAMING_SNAKE_CASE    )
				while True:
								__a       =		tuple(itertools.islice(_SCREAMING_SNAKE_CASE				,     _SCREAMING_SNAKE_CASE    )    )
								if not chunk:
												return
								yield chunk

def   lowerCAmelCase__						(							_SCREAMING_SNAKE_CASE       :			str    ):
				"""simple docstring"""







				__a       =		"""""".join([c.upper() for c in dirty if c in string.ascii_letters]    )
				__a       =		""""""

				if len(_SCREAMING_SNAKE_CASE    ) < 2:
								return dirty

				for i in range(len(_SCREAMING_SNAKE_CASE    ) - 1    ):
								clean += dirty[i]

								if dirty[i] == dirty[i + 1]:
												clean += "X"

				clean += dirty[-1]

				if len(_SCREAMING_SNAKE_CASE    ) & 1:
								clean += "X"

				return clean

def   lowerCAmelCase__						(							_SCREAMING_SNAKE_CASE       :			str    ):
				"""simple docstring"""







				__a       =		"""ABCDEFGHIKLMNOPQRSTUVWXYZ"""
				# we're using a list instead of a '2d' array because it makes the math
				# for setting up the table and doing the actual encoding/decoding simpler
				__a       =		[]

				# copy key chars into the table if they are in `alphabet` ignoring duplicates
				for char in key.upper():
								if char not in table and char in alphabet:
												table.append(_SCREAMING_SNAKE_CASE    )

    # fill the rest of the table in with the remaining alphabet chars
				for char in alphabet:
								if char not in table:
												table.append(_SCREAMING_SNAKE_CASE    )

				return table

def   lowerCAmelCase__						(							_SCREAMING_SNAKE_CASE       :			str				,     _SCREAMING_SNAKE_CASE       :			str    ):
				"""simple docstring"""







				__a       =		generate_table(_SCREAMING_SNAKE_CASE    )
				__a       =		prepare_input(_SCREAMING_SNAKE_CASE    )
				__a       =		""""""

				# https://en.wikipedia.org/wiki/Playfair_cipher#Description
				for chara, chara in chunker(_SCREAMING_SNAKE_CASE				,     2    ):
								__a     ,					__a       =		divmod(table.index(_SCREAMING_SNAKE_CASE    )				,     5    )
								__a     ,					__a       =		divmod(table.index(_SCREAMING_SNAKE_CASE    )				,     5    )

								if rowa == rowa:
												ciphertext += table[rowa * 5 + (cola + 1) % 5]
												ciphertext += table[rowa * 5 + (cola + 1) % 5]
								elif cola == cola:
												ciphertext += table[((rowa + 1) % 5) * 5 + cola]
												ciphertext += table[((rowa + 1) % 5) * 5 + cola]
								else:  # rectangle
												ciphertext += table[rowa * 5 + cola]
												ciphertext += table[rowa * 5 + cola]

				return ciphertext

def   lowerCAmelCase__						(							_SCREAMING_SNAKE_CASE       :			str				,     _SCREAMING_SNAKE_CASE       :			str    ):
				"""simple docstring"""







				__a       =		generate_table(_SCREAMING_SNAKE_CASE    )
				__a       =		""""""

				# https://en.wikipedia.org/wiki/Playfair_cipher#Description
				for chara, chara in chunker(_SCREAMING_SNAKE_CASE				,     2    ):
								__a     ,					__a       =		divmod(table.index(_SCREAMING_SNAKE_CASE    )				,     5    )
								__a     ,					__a       =		divmod(table.index(_SCREAMING_SNAKE_CASE    )				,     5    )

								if rowa == rowa:
												plaintext += table[rowa * 5 + (cola - 1) % 5]
												plaintext += table[rowa * 5 + (cola - 1) % 5]
								elif cola == cola:
												plaintext += table[((rowa - 1) % 5) * 5 + cola]
												plaintext += table[((rowa - 1) % 5) * 5 + cola]
								else:  # rectangle
												plaintext += table[rowa * 5 + cola]
												plaintext += table[rowa * 5 + cola]

				return plaintext
