import Foundation

func listSquared(_ m: Int, _ n: Int) -> [(Int, Int)] {
    var buff: [Int] = []
    var out: [(Int, Int)] = []

    for x in m...n {
      buff.removeAll()
      let sqr = sqrt(Double(x))
      for i in 2..<Int(sqr)+1 {
        if x % i == 0 {
            print(i)
            if i != (x/i) {
                buff.append((x/i)*(x/i))
            }
        }
      }

      let sum = buff.reduce(0, +)
      let isPrime = sum > 1 && !(2..<sum).contains { sum % $0 == 0 }
      if isPrime {
        out.append((x, sum))
      }


    }
    return out
}

listSquared(1, 250)