Circular shift program

import java.util.Scanner;
class CircularShift
{
    static int list[]; 
    static int size;
    void input()
    {
        Scanner sc = new Scanner(System.in);
        System.out.println("Enter the number of elements");
        size = sc.nextInt();
        list = new int[size];
        System.out.println("Enter the elements");
        for(int i = 0;i<size;i++)
        {
            list[i] = sc.nextInt(); 
        }
    }

    void Circular_Shift()
    {
        int temp=list[size-1];
        for(int i=size-1;i>0;i--)
        {
            list[i]=list[i-1];
        }
        list[0]=temp; 
    }

    void reverse()
    {
        for (int i = 0; i < size/2; i++) 
        {
            int temp = list[i];
            list[i] = list[size - 1 - i];
            list[size - 1 - i] = temp;
        }
    }

    void display()
    {
        System.out.println("The array is as follows :");
        for(int i = 0;i<=size;i++)
        {
            if(i!=0 && i<size)
            {
                Circular_Shift();  
                for(int j = 0;j<size;j++)
                {
                    System.out.print(list[j]+",");  
                }
                System.out.println("");
            }
            if(i==0)
            {
                for(int j = 0;j<size;j++)
                {
                    System.out.print(list[j]+",");
                }
                System.out.println();
            }
            if(i==(size-1))
            {
                Circular_Shift();
            }
        }
    }

    public static void main()
    {
        CircularShift obj = new CircularShift();
        obj.input();
        obj.display();
        obj.reverse();
        System.out.println("Reversed array :");
        for(int i = 0;i<size;i++)
        {
            System.out.print(list[i]+","); 
        }
    }
}