增长的序列的算法，怎么利用C语言的程序代码设计的思想如何解决的？

Problem Description
This is a problem from ZOJ 1499.To make it easyer,you just need output the last number.If there are leading zeros you should delete it.

Input
Input will consist of multiple test cases. Each case will consist of one line, containing a string of digits of maximum length 80. A line consisting of a single 0 terminates input.

Output
For each instance,output the last number.

Sample Input
3456
3546
3526
0001
100000101

Sample Output
6
46
26
1
101