def length_of_longest_subarray(arr):
    if not arr:
        return 0

    max_length = 1
    current_length = 1
    seen = set()

    for i in range(1, len(arr)):
        if arr[i] not in seen:
            seen.add(arr[i])
            current_length += 1
        else:
            max_length = max(max_length, current_length)
            seen.clear()
            current_length = 1

    return max(max_length, current_length)

# 示例输入
input_str = "789101112131415"
input_list = list(map(int, input_str.split()))

# 计算结果并输出
result = length_of_longest_subarray(input_list)
print("不含有重复数字的最长子数组的长度为：", result)