def most_common_bit_for_position(numbers: list[str], position: int) -> int:
    """calculates the most common bit for a given position (if equal, returns 1)"""
    sum_for_position = 0
    for number in numbers:
        sum_for_position += int(number[position])

    return int(sum_for_position >= len(numbers) / 2)