{"problem":{"name":"Flatten","description":{"content":"Given are $N$ positive integers $A_1,...,A_N$. Consider positive integers $B_1, ..., B_N$ that satisfy the following condition. Condition: For any $i, j$ such that $1 \\leq i < j \\leq N$, $A_i B_i = A_","description_type":"Markdown"},"platform":"AtCoder","limit":{"time_limit":2000,"memory_limit":262144},"difficulty":"None","is_remote":true,"is_sync":true,"sync_url":null,"sign":"abc152_e"},"statements":[{"statement_type":"Markdown","content":"Given are $N$ positive integers $A_1,...,A_N$.\nConsider positive integers $B_1, ..., B_N$ that satisfy the following condition.\nCondition: For any $i, j$ such that $1 \\leq i < j \\leq N$, $A_i B_i = A_j B_j$ holds.\nFind the minimum possible value of $B_1 + ... + B_N$ for such $B_1,...,B_N$.\nSince the answer can be enormous, print the sum modulo ($10^9 +7$).\n\n## Constraints\n\n*   $1 \\leq N \\leq 10^4$\n*   $1 \\leq A_i \\leq 10^6$\n*   All values in input are integers.\n\n## Input\n\nInput is given from Standard Input in the following format:\n\n$N$\n$A_1$ $...$ $A_N$\n\n[samples]","is_translate":false,"language":"English"}],"meta":{"iden":"abc152_e","tags":[],"sample_group":[["3\n2 3 4","13\n\nLet $B_1=6$, $B_2=4$, and $B_3=3$, and the condition will be satisfied."],["5\n12 12 12 12 12","5\n\nWe can let all $B_i$ be $1$."],["3\n1000000 999999 999998","996989508\n\nPrint the sum modulo $(10^9+7)$."]],"created_at":"2026-03-03 11:01:13"}}