Let n be a positive integer. On a board there are written all integers from 1 to n. Alina does n moves consecutively: for every integer m (1≤m≤n) the move m consists in changing the sign of every number divisible by m. At the end Alina sums the numbers. Find this sum. combinatoricsnumber theory