n = gets.to_i
c = [0] + gets.split.map(&:to_i)
mod = ->(m) {
	sum = c.sum
	c.each_with_index.sum { |cnt, x|
		sum -= cnt
		10.pow(cnt, m).pred * x * 10.pow(sum, m)
	}
}
if c.count { _1 > 0 } == 1
	M = 10**9 + 7
	p mod[10**9 + 7] * 111111112 % M
else
	k = 9 * (1..9).select { c[_1] > 0 }.combination(2).map { _1 - _2 }.reduce { _1. gcd _2 }
	puts k.gcd(mod[k * 9] / 9)
end