int[] c = new int[n * n];
            int k = 0;
            for (int redove = n-1; redove >= 0; redove--)
            {
                if(redove%2==0)
                {

                    for (int koloni = n-1; koloni >= 0; koloni++)
                    {
                        c[k] = a[redove, koloni];
                        k++;
                    }
                }
                else
                {
                    for (int koloni = 0; koloni < n; koloni++)
                    {
                        c[k] = a[redove, koloni];
                        k++;
                    }
                }
            }