Problem Statement  
In a simple game, two players take turns placing 'X's in a 4x4 grid. Players may place 'X's in any available location ('.' in the input) that is not horizontally or vertically adjacent to another 'X'. The player who places the last 'X' wins the game. It is your turn and you want to know how many of the moves you could make guarantee you will win the game, assuming you play perfectly.  
Definition  
 
Constraints  
  grid will contain exactly 4 elements.  
  Each element of grid will contain 4 characters ('X's or '.'s), inclusive.  
  There will be no two horizontally or vertically adjacent 'X's in grid.  
Examples  
0)  
 
1)  
 
2)  
 
3)  
 
4)  
