Let's denote *d*(*n*) as the number of divisors of a positive integer *n*. You are given three integers *a*, *b* and *c*. Your task is to calculate the following sum:

Find the sum modulo 1073741824 (2<sup class="upper-index">30</sup>).
The first line contains three space-separated integers *a*, *b* and *c* (1 ≤ *a*, *b*, *c* ≤ 100).
# Function to calculate the number of divisors of a positive integer n
def count_divisors(n):
    divisors = 0
    for i in range(1, n + 1):
        if n % i == 0:
            divisors += 1
    return divisors

# Read input values a, b, and c
a, b, c = map(int, input().split())

# Calculate the number of divisors for each integer
divisors_a = count_divisors(a)
divisors_b = count_divisors(b)
divisors_c = count_divisors(c)

# Calculate the sum of the divisors and take the modulo 1073741824
result = (divisors_a + divisors_b + divisors_c) % 1073741824

# Print the result
print(result)

  	  			 			 		 	 		  	 	 	 	 	