Problem: Many of you know the famous Fibonacci sequence F:
F[1] = 1
F[2] = 1
F[i] = F[i - 1] + F[i - 2] for i > 2

Thus each number in sequence is a sum of two previous numbers except two first which are define as 1.

You've decided to create you own Fibonacci sequence. It's very similar to the one described above, but the first two numbers now are arbitrary non-negative integers A and B ( F[1] = A and F[2] = B ). Now you want to compute the N-th number in your sequence.

Input
The only line contains 3 space-separated integers A, B, N.

Output
Output one integer - the N-th number in your sequence.

Constraints
0 < A, B, N ≤ 10

SAMPLE INPUT
1 3 4

SAMPLE OUTPUT
7

Solution (in PYTHON):

Solution:
def getNthFibboNum(first, second, seq_count):
    count = 2
    nextNum = 0
    bFound = False
    while not bFound:
        nextNum = first + second
        first = second
        second = nextNum
        count += 1
        if count == seq_count:
            bFound = True
    return nextNum


values = raw_input()
(first, second, seq_count) = values.split()
if seq_count == '1':
    print first
elif seq_count == '2':
    print second
else:
    print getNthFibboNum(int(first), int(second), int(seq_count))