A super Anticlockwise Circular Matrix program

import java.util.*;
class AnticlockMatrix
{
    public static void main(String args[])
    {
        Scanner sc = new Scanner(System.in);
        System.out.print("Enter the size of the matrix: ");
        int n = sc.nextInt();

        int A[][] = new int[n][n];
        int k=n*n, c1=0, c2=n-1, r1=0, r2=n-1;

        while(k>=1)
        {
            for(int i=c1;i<=c2;i++)
            {
                A[r1][i]=k--;
            }

            for(int j=r1+1;j<=r2;j++)
            {
                A[j][c2]=k--;
            }

            for(int i=c2-1;i>=c1;i--)
            {
                A[r2][i]=k--;
            }

            for(int j=r2-1;j>=r1+1;j--)
            {
                A[j][c1]=k--;
            }
            c1++;
            c2--;
            r1++;
            r2--;
        }

        System.out.println("The Circular Matrix is:");
        for(int i=0;i<n;i++)
        {
            for(int j=0;j<n;j++)
            {
                System.out.print(A[i][j]+ "\t");
            }
            System.out.println();
        }
    }
}