Sum – Remove Last Occurring Zero

The program must accept N integers as the input. For each integer X among the N integers, the program must remove the last occurring 0 in X. Then the program must print the sum of those N modified integers as the output.

Boundary Condition(s):
1 <= N <= 100
1 <= Each integer value <= 10^8

Input Format:
The first line contains N.
The second line contains N integers separated by a space.

Output Format:
The first line contains the sum of those N modified integers.

Example Input/Output 1:
Input:
4
160 875 5000 20111

Output:
3502

Explanation:
After removing the last occurring 0 in 160, the integer becomes 16.
The integer 875 has no zeros. So it remains same.
After removing the last occurring 0 in 5000, the integer becomes 500.
After removing the last occurring 0 in 20111, the integer becomes 2111.
So the sum of those modified values is 3502 (16 + 875 + 500 + 2111).
Hence the output is 3502

Example Input/Output 2:
Input:
8
609 7070 21 308 800 2800 5007 690

Output:
1771

N=int(input())
arr=list(map(int,input().split()))
req_num=0
for foo in arr:
    temp=''
    flag=1
    for bar in str(foo)[::-1]:
        if bar=='0' and flag==1:
            flag=0
            continue
        else:
            temp+=bar
    req_num+=int(temp[::-1])
print(req_num)