def check_if_num_exist(num, s):
index = 0
for ch in s:
if num[index] == ch:
index += 1
if len(num) == index:
break
return 1 if index == len(num) else 0
def convert_string_to_becomes_divisible_by_8(s):
for i in range(8, int(1e3), 8):
num = str(i)
if check_if_num_exist(num, s) == 1:
return num
return "-1"
s1 = "127892"
result = convert_string_to_becomes_divisible_by_8(s1)
print(result)
s2 = "1201674"
result = convert_string_to_becomes_divisible_by_8(s2)
print(result)
s3 = "1209574"
result = convert_string_to_becomes_divisible_by_8(s3)
print(result)
s4 = "190395473"
result = convert_string_to_becomes_divisible_by_8(s4)
print(result)
s5 = "1309577"
result = convert_string_to_becomes_divisible_by_8(s5)
if result != "-1":
s5 = result
print(s5)
else:
print("No numeric characters combination divisible by 8")
'''
run:
8
16
24
104
No numeric characters combination divisible by 8
'''
