### Warm-Up

Given a positive integer `n`

write a function that returns how many *unique* factors it has. If it only has two (`n`

itself and `1`

) return `"prime"`

.

example:

```
factorCount(4);
//returns 3 (1, 2, and 4 are factors of 4)
factorCount(3);
//returns "prime"
```