'''simple docstring'''




import os
from math import logaa






def __lowerCAmelCase			(							UpperCamelCase__ = "base_exp.txt"    )     ->   int:
    __lowerCamelCase          =  0
    __lowerCamelCase          =  0
    for i, line in enumerate(open(os.path.join(os.path.dirname(UpperCamelCase__    )    ,  UpperCamelCase__    )    )    ):
        __lowerCamelCase     ,  __lowerCamelCase          =  list(map(UpperCamelCase__    ,  line.split(''','''    )    )    )
        if x * logaa(UpperCamelCase__    ) > largest:
            __lowerCamelCase          =  x * logaa(UpperCamelCase__    )
            __lowerCamelCase          =  i + 1
    return result


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

'''simple docstring'''




from __future__ import annotations

from typing import Any






def __lowerCAmelCase			(							UpperCamelCase__    )     ->   None:
    create_state_space_tree(UpperCamelCase__    ,  []    ,  0    )






def __lowerCAmelCase			(							UpperCamelCase__    ,  UpperCamelCase__    ,  UpperCamelCase__    )     ->   None:

    if index == len(UpperCamelCase__    ):
        print(UpperCamelCase__    )
        return

    create_state_space_tree(UpperCamelCase__    ,  UpperCamelCase__    ,  index + 1    )
    current_subsequence.append(sequence[index]    )
    create_state_space_tree(UpperCamelCase__    ,  UpperCamelCase__    ,  index + 1    )
    current_subsequence.pop()


if __name__ == "__main__":
  __UpperCAmelCase												=[3, 1, 2, 4]
  generate_all_subsequences(seq)

  seq.clear()
  seq.extend(["A", "B", "C"])
  generate_all_subsequences(seq)
