
"""simple docstring"""




import re


def 						UpperCAmelCase      (     a_						)		->     bool:







				"""simple docstring"""



				__A             =			re.compile(
				    r"^(?:0|94|\+94|0{2}94)" r"7(0|1|2|4|5|6|7|8)" r"(-| |)" r"\d{7}$"						)

				return bool(re.search(a_		,       a_						)						)


if __name__ == "__main__":
					SCREAMING_SNAKE_CASE							:Tuple										=    '0094702343221'

					print(is_sri_lankan_phone_number(phone))


from __future__ import annotations

import math
from collections import Counter
from string import ascii_lowercase


def 						UpperCAmelCase      (     a_						)		->     None:







				"""simple docstring"""



				__A      ,							__A             =			analyze_text(a_						)
				__A             =			list(" " + ascii_lowercase						)
				# what is our total sum of probabilities.
				__A             =			sum(single_char_strings.values()						)

				# one length string
				__A             =			0
				# for each alpha we go in our dict and if it is in it we calculate entropy
				for ch in my_alphas:
								if ch in single_char_strings:
												__A             =			single_char_strings[ch]
												__A             =			my_str / all_sum
												my_fir_sum += prob * math.loga(a_						)  # entropy formula.

    # print entropy
				print(F'''{round(-1 * my_fir_sum						):.1f}'''						)

				# two len string
				__A             =			sum(two_char_strings.values()						)
				__A             =			0
				# for each alpha (two in size) calculate entropy.
				for cha in my_alphas:
								for cha in my_alphas:
												__A             =			cha + cha
												if sequence in two_char_strings:
																__A             =			two_char_strings[sequence]
																__A             =			int(a_						) / all_sum
																my_sec_sum += prob * math.loga(a_						)

    # print second entropy
				print(F'''{round(-1 * my_sec_sum						):.1f}'''						)

				# print the difference between them
				print(F'''{round((-1 * my_sec_sum) - (-1 * my_fir_sum)						):.1f}'''						)


def 						UpperCAmelCase      (     a_						)		->     tuple[dict, dict]:







				"""simple docstring"""



				__A             =			Counter()  # type: ignore
				__A             =			Counter()  # type: ignore
				single_char_strings[text[-1]] += 1

				# first case when we have space at start.
				two_char_strings[" " + text[0]] += 1
				for i in range(0		,       len(a_						) - 1						):
								single_char_strings[text[i]] += 1
								two_char_strings[text[i : i + 2]] += 1
				return single_char_strings, two_char_strings


def 						UpperCAmelCase      (     )		->     Optional[Any]:







				"""simple docstring"""



				import doctest

				doctest.testmod()
				# text = (
				#     "Had repulsive dashwoods suspicion sincerity but advantage now him. Remark "
				#     "easily garret nor nay. Civil those mrs enjoy shy fat merry. You greatest "
				#     "jointure saw horrible. He private he on be imagine suppose. Fertile "
				#     "beloved evident through no service elderly is. Blind there if every no so "
				#     "at. Own neglected you preferred way sincerity delivered his attempted. To "
				#     "of message cottage windows do besides against uncivil.  Delightful "
				#     "unreserved impossible few estimating men favourable see entreaties. She "
				#     "propriety immediate was improving. He or entrance humoured likewise "
				#     "moderate. Much nor game son say feel. Fat make met can must form into "
				#     "gate. Me we offending prevailed discovery. "
				# )

				# calculate_prob(text)


if __name__ == "__main__":
					main()
