using System;

public class Program

{

    public static void Main()

    {

        int []cells = {0, 1, 0, 1, 

                    0, 1, 0, 1}; 

    int k = 3; 

    int n = cells.Length; 

    cellCompete(cells, k); 

    }

    private const int INACTIVE=0;

    private const int ACTIVE=1;

    static int[] cellCompete(int[] cells, int days)

{ 

      var n = cells.Length;

    // copy cells[] array into 

    // temp [] array 

    var temp = new int[n]; 

    for (int i = 0; i < n; i++) 

    temp[i] = cells[i]; 

    // Iterate for k days 

    while (days-- > 0) { 

    // Finding next values  

    // for corner cells 

    temp[0] = /*Math.Abs(INACTIVE - cells[1]);*/0 ^ cells[1]; 

    temp[n - 1] = /*Math.Abs(INACTIVE - cells[n - 2]); */0 ^ cells[n-2]; 

    // Compute values of intermediate cells 

    // If both cells active or inactive, then  

    // temp[i]=0 else temp[i] = 1. 

    for (int i = 1; i <= n - 2; i++) 

        temp[i] = cells[i - 1] ^ cells[i + 1]; 

    // Copy temp[] to cells[]  

    // for next iteration 

    for (int i = 0; i < n; i++) 

        cells[i] = temp[i]; 

    } 

    // count active and inactive cells 

    int active = 0, inactive = 0; 

    for (int i = 0; i < n; i++) 

    if (cells[i] == 1) 

        active++; 

    else

        inactive++; 

    Console.Write("Active Cells = " + active + ", " +  

                  "Inactive Cells = " + inactive); 

        return temp;

} 

}