Divisor Game LeetCode solution in JavaScript

1
var divisorGame = function (n) {
2
  let count = 0;
3
  while (true) {
4
    let flag = true;
5
    for (let i = 1; i < n; i++) {
6
      if (n % i == 0) {
7
        flag = false;
8
        n = n - i;
9
        break;
10
      }
11
    }
12
    if (flag) {
13
      if (count % 2 == 0) return false;
14
      else return true;
15
    }
16
    count++;
17
  }
18
};