For this Question: The college mess offers circular and square parathas at lunch break, referred to by numbers 0 and 1 respectively. All students stand in a queue. Each student either prefers square or circular paratha.

The number of parathas in the mess is equal to the number of students. The sandwiches are placed in a stack. At each step:

If the student at the front of the queue prefers the parathas on the top of the stack, they will take it and leave the queue.
Otherwise, they will leave it and go to the queue's end.
This continues until none of the queue students want to take the top parathas and are thus unable to eat.

You are given two integer arrays students and parathas where parathas[i] is the type of i​​​​​​th paratha in the stack (i = 0 is the top of the stack) and students[j] is the preference of the j​​​​​​th student in the initial queue (j = 0 is the front of the queue). Return the number of students that are unable to eat.There is an integer n(number of students) given as input in the first line.
In the Second line, n space- separated integers(Choice of students) are given as input.
In the Third line, n space- separated integers(type of parathas) are given as input.

<b>Constraints</b>
1 &le; n &le; 10<sup>3</sup>
0 &le; paraths[i], students[i] &le; 1
0 &le; i &le; n-1Return the count of students who left hungry.Sample Input:
4
1 1 0 0
0 1 0 1

Sample Output:
0

Explanation:
- Front student leaves the top paratha and returns to the end of the line making students = [1, 0, 0, 1].
- Front student leaves the top paratha and returns to the end of the line making students = [0, 0, 1, 1].
- Front student takes the top paratha and leaves the line making students = [0, 1, 1] and parathas = [1, 0, 1].
- Front student leaves the top paratha and returns to the end of the line making students = [1, 1, 0].
- Front student takes the top paratha and leaves the line making students = [1, 0] and parathas = [0, 1].
- Front student leaves the top paratha and returns to the end of the line making students = [0, 1].
- Front student takes the top paratha and leaves the line making students = [1] and parathas = [1].
- Front student takes the top paratha and leaves the line making students = [] and parathas = [].
Hence all students are able to eat., I have written this Solution Code: import java.util.*;

public class Main {
    public int fun(int[] students, int[] parathas) {
        int[] a = {0, 0};
        for (int i=0;i<students.length;i++)
            a[students[i]]+=1;
        int k = 0;
        while (k < parathas.length){
            if (a[parathas[k]] > 0)
                a[parathas[k]]-=1;
            else
                break;
            k+=1;}
        return parathas.length-k;
    }
	public static void main(String[] args) {
		Main obj=new Main();
		Scanner sc=new Scanner(System.in);
		int n=sc.nextInt();
        int[] students=new int[n];
        int[] parathas=new int[n];
        for(int i=0;i<n;i++){
            students[i]=sc.nextInt();
        }
        for(int i=0;i<n;i++){
            parathas[i]=sc.nextInt();
        }
        int ans=obj.fun(students, parathas);
		System.out.println(ans);
		return;
	}
}, In this Programming Language: Java, Now tell me if this Code is compilable or not?