How many ways can the numbers \(1,1,1,1,1,2,3,\dots,9\) be listed in such a way that no \(1\)’s are adjacent? The number 1 appears five times and each of 2 to 10 appear exactly once.