/**
   Problem Name : Divisor Game
   Problem URL : https://leetcode.com/problems/divisor-game/
   Description :
    Alice and Bob take turns playing a game, with Alice starting first.
    Initially, there is a number n on the chalkboard. 
    On each player's turn, that player makes a move consisting of:
    Choosing any x with 0 < x < n and n % x == 0.
    Replacing the number n on the chalkboard with n - x.
    Also, if a player cannot make a move, they lose the game.
    Return true if and only if Alice wins the game, assuming both players play optimally.
    
   Difficulty : Easy
   Language : C#
   Category : Algorithms
*/
public class Solution 
{
    public bool DivisorGame(int n) 
    {
        if(n % 2 == 0)
            return true;
        return false;
    }
}