Problem Brief

Get Data Dependence Sum (Fungible :)

INTERNOA

See Amazon online assessment and hiring insights

Data analysts at Amazon are analyzing time-series data. It was concluded that the data of the n^th item was dependent on the data of some x^th day if there is a positive integer k such that floor(n / k) = x where floor() represents the largest integer less than or equal to z.

Given n, find the sum of all the days' numbers on which the data of the x^th (0 ≤ x < n) will be dependent.

Function Description

Complete the function getDataDependenceSum in the editor below.

getDataDependenceSum takes the following arguments:

long int n: the day to analyze the data dependency for

Returns

long int: the sum of days on which the data is dependent

Input Format For Custom Testing

The first line contains a long integer, n.

🌷, As always, a supa huge TY to tomtom, spike and aikay! You three da best 4ever!! 🐡 🐡 🐡

1Example 1

Input

n = 13

Output

Explanation

The data of the n = 13^th day is dependent on [0, 1, 2, 3, 4, 6, 13] obtained for k = [14, 13, 6, 4, 3, 2, 1].

2Example 2

Input

n = 1

Output

Explanation

The only dependency is 1.

3Example 3

Input

n = 5

Output

Explanation

Hence, the answer is 0 + 1 + 2 + 5 == 8 :)

Constraints

Limits and guarantees your solution can rely on.

1 ≤ n ≤ 10^10