"""simple docstring"""


def    UpperCAmelCase       (						UpperCAmelCase   )							-> list:
     snake_case_   			=   []
     snake_case_   			=   1

     for i in range(len(UpperCAmelCase   )   ):
          if i + 1 < len(UpperCAmelCase   ) and text[i] == text[i + 1]:
               count += 1
          else:
               encoded.append((text[i], count)   )
               snake_case_   			=   1

     return encoded







def    UpperCAmelCase       (						UpperCAmelCase   )							-> str:
     return "".join(char * length for char, length in encoded   )


if __name__ == "__main__":
    from doctest import testmod

    testmod(name='''run_length_encode''', verbose=True)
    testmod(name='''run_length_decode''', verbose=True)


"""simple docstring"""


from math import factorial







def    UpperCAmelCase       (						UpperCAmelCase		,   UpperCAmelCase   )							-> List[str]:
     return factorial(UpperCAmelCase   ) / (factorial(UpperCAmelCase   ) * factorial(n - r   ))







def    UpperCAmelCase       (						)							-> Optional[Any]:
     snake_case_   			=   0

     for i in range(1		,   101   ):
          for j in range(1		,   i + 1   ):
               if combinations(UpperCAmelCase		,   UpperCAmelCase   ) > 1e6:
                    total += 1
     return total


if __name__ == "__main__":
    print(solution())

