





import math_equivalence  # From: git+https://github.com/hendrycks/math.git

import datasets


snake_case 				=       """\
@article{hendrycksmath2021,
  title={Measuring Mathematical Problem Solving With the MATH Dataset},
  author={Dan Hendrycks
    and Collin Burns
    and Saurav Kadavath
    and Akul Arora
    and Steven Basart
    and Eric Tang
    and Dawn Song
    and Jacob Steinhardt},
  journal={arXiv preprint arXiv:2103.03874},
  year={2021}
}
"""


snake_case 				=       """\
This metric is used to assess performance on the Mathematics Aptitude Test of Heuristics (MATH) dataset.
It first canonicalizes the inputs (e.g., converting \"1/2\" to \"\\frac{1}{2}\") and then computes accuracy.
"""


snake_case 				=       r"""
Calculates accuracy after canonicalizing inputs.

Args:
    predictions: list of predictions to score. Each prediction
        is a string that contains natural language and LaTex.
    references: list of reference for each prediction. Each
        reference is a string that contains natural language
        and LaTex.
Returns:
    accuracy: accuracy after canonicalizing inputs
        (e.g., converting \"1/2\" to \"\\frac{1}{2}\")

Examples:
    >>> metric = datasets.load_metric(\"competition_math\")
    >>> results = metric.compute(references=[\"\\frac{1}{2}\"], predictions=[\"1/2\"])
    >>> print(results)
    {'accuracy': 1.0}
"""





@datasets.utils.file_utils.add_end_docstrings(_DESCRIPTION					,	_KWARGS_DESCRIPTION	)
class 				A_				(      datasets.Metric	):







							"""simple docstring"""





							def    __UpperCAmelCase (    self	:	List[str]  )						->					Union[str, Any]:
									return datasets.MetricInfo(
									    description=_DESCRIPTION						,citation=_CITATION						,inputs_description=_KWARGS_DESCRIPTION						,features=datasets.Features(
									        {
									            'predictions': datasets.Value('string'  ),
									            'references': datasets.Value('string'  ),
									        }  )						,homepage='https://github.com/hendrycks/math'						,codebase_urls=['https://github.com/hendrycks/math']						,)







							def    __UpperCAmelCase (    self	:	List[Any]						,__A	:	Optional[Any]						,__A	:	List[Any]  )						->					Optional[int]:
									_lowercase							= 0.0
									for i, j in zip(A_						,A_  ):
											n_correct += 1.0 if math_equivalence.is_equiv(A_						,A_  ) else 0.0
									_lowercase							= n_correct / len(A_  )
									return {
									    "accuracy": accuracy,
									}






def 							SCREAMING_SNAKE_CASE__       (  snake_case__  :List[str]     )      ->						Dict:
  _lowercase							= len(snake_case__     )
  while cur > 1:
    # Find the maximum number in arr
    _lowercase							= arr.index(max(arr[0:cur]     )     )
    # Reverse from 0 to mi
    _lowercase							= arr[mi::-1] + arr[mi + 1 : len(snake_case__     )]
    # Reverse whole list
    _lowercase							= arr[cur - 1 :: -1] + arr[cur : len(snake_case__     )]
    cur -= 1
  return arr


if __name__ == "__main__":
      snake_case 				=       input("""Enter numbers separated by a comma:\n""").strip()
      snake_case 				=       [int(item) for item in user_input.split(""",""")]
      print(pancake_sort(unsorted))