Problem:
Score : 300 points

Problem Statement

You are given N positive integers a_1, a_2, ..., a_N.

For a non-negative integer m, let f(m) = (m\ mod\ a_1) + (m\ mod\ a_2) + ... + (m\ mod\ a_N).

Here, X\ mod\ Y denotes the remainder of the division of X by Y.

Find the maximum value of f.

Constraints

All values in input are integers.

2 \leq N \leq 3000

2 \leq a_i \leq 10^5

Input

Input is given from Standard Input in the following format:

N
a_1 a_2 ... a_N

Output

Print the maximum value of f.

Sample Input 1

3
3 4 6

Sample Output 1

10

f(11) = (11\ mod\ 3) + (11\ mod\ 4) + (11\ mod\ 6) = 10 is the maximum value of f.

Sample Input 2

5
7 46 11 20 11

Sample Output 2

90

Sample Input 3

7
994 518 941 851 647 2 581

Sample Output 3

4527

Solution in Go (1.6) (judge verdict: Wrong Answer)

package main

import (
	"fmt"
	"sort"
)

func mergeMap(a, b map[int]bool) map[int]bool {
	for i, v := range b {
		a[i] = v
	}
	return a
}

func primeFactorsSlice(a []int) []int {
	ret := []int{}
	m := map[int]bool{}
	for _, v := range a {
		r := primeFactors(v)
		m = mergeMap(m, r)
	}

	for i := range m {
		ret = append(ret, i)
	}
	sort.Ints(ret)

	return ret
}

func primeFactors(n int) map[int]bool {
	factors := make([]int, 0)
	i := 2
	for i*i <= n {
		r := n % i
		if r != 0 {
			i++
		} else if r == 0 {
			n /= i
			factors = append(factors, i)
		}
	}
	if n > 1 {
		factors = append(factors, n)
	}
	ret := map[int]bool{}
	for _, v := range factors {
		ret[v] = true
	}
	return ret
}

func f(m int, a []int) int {
	var ret int
	for i := 0; i < len(a); i++ {
		ret += m % a[i]
	}
	return ret
}

func mul(a []int) int {
	pf := primeFactorsSlice(a)

	ret := 1

	for _, v := range append(pf, a...) {
		ret *= v
	}
	return ret
}

func main() {
	var N int

	fmt.Scan(&N)
	var a = make([]int, N)

	for i := 0; i < N; i++ {
		fmt.Scan(&a[i])
	}

	sort.Ints(a)

	fmt.Println(f(mul(a)-1, a))
}