For this Question: We define a weird series as follows:
7, 77, 777, 7777, 77777, 777777,. .
Given a positive integer N find where is first occurrence of a number divisible by N in the given series.
If the series contains no multiple of N, print -1 instead.Input contains a single integer N.

Constraints:
1 <= N <= 1000000Print the position of the first position of a multiple of N in the series. (For example, if the first occurrence is the third element of the series, print 3)Sample Input 1
101

Sample Output 1
4

Explanation: 7, 77, 777 are not multiple of 101 whereas 7777 is a multiple of 101.

Sample Input 2
2

Sample Output 2
-1

Sample Input 3
7

Sample Output 3
1, I have written this Solution Code: import java.io.*;
import java.util.*;



class Main {
	public static void main (String[] args) throws IOException{
        BufferedReader br = new BufferedReader(new InputStreamReader(System.in));
        int num = Integer.parseInt(br.readLine());
        System.out.print(wierdSeven(num));

	}


    private static int wierdSeven(int n){
        int temp = 7,multiple=0;
        for(int i=1;i<=n;i++){

            multiple = multiple+temp;
            if(multiple%n==0){
                return i;
            }
            multiple = multiple%n;
            temp = temp*10;
            temp = temp%n;
        }
        return -1;
    }

}, In this Programming Language: Java, Now tell me if this Code is compilable or not?