Suppose \(n \geq 2\) is an integer with the property that whenever a prime \(p\) divides \(n, p^{2}\) also divides \(n\) (i.e., all primes in the prime factorization of \(n\) appear at least to the power 2). Prove that \(n\) can be written as the product of a square and a cube.