import java.io.*; import java.util.*; import java.util.function.*; import java.util.stream.*; public class Main { public static void main(String[] args) throws Exception { Scanner sc = new Scanner(); int n = sc.nextInt(); TreeMap added = new TreeMap<>(); List> values = new ArrayList<>(); for (int i = 0; i < n; i++) { int x = sc.nextInt(); Set current = new HashSet<>(); for (int j = 2; j <= Math.sqrt(x); j++) { while (x % j == 0) { x /= j; current.add(j); added.put(j, null); } } if (x > 1) { current.add(x); added.put(x, null); } values.add(current); } int idx = n; for (int x : added.keySet()) { added.put(x, idx++); } UnionFindTree uft = new UnionFindTree(idx); for (int i = 0; i < n; i++) { for (int x : values.get(i)) { uft.unite(i, added.get(x)); } } System.out.println(Math.min(uft.size * 2, (uft.size - 1L) * added.firstKey())); } static class UnionFindTree { int[] parents; int size; public UnionFindTree(int size) { this.size = size; parents = new int[size]; for (int i = 0; i < size; i++) { parents[i] = i; } } public int find(int x) { if (x == parents[x]) { return x; } else { return parents[x] = find(parents[x]); } } public boolean same(int x, int y) { return find(x) == find(y); } public void unite(int x, int y) { if (!same(x, y)) { size--; parents[find(x)] = find(y); } } } } class Scanner { BufferedReader br; StringTokenizer st = new StringTokenizer(""); StringBuilder sb = new StringBuilder(); public Scanner() { try { br = new BufferedReader(new InputStreamReader(System.in)); } catch (Exception e) { } } public int nextInt() { return Integer.parseInt(next()); } public long nextLong() { return Long.parseLong(next()); } public double nextDouble() { return Double.parseDouble(next()); } public String next() { try { while (!st.hasMoreTokens()) { st = new StringTokenizer(br.readLine()); } } catch (Exception e) { e.printStackTrace(); } finally { return st.nextToken(); } } }