Takahashi has decided to distribute N AtCoder Crackers to K users of as evenly as possible. When all the crackers are distributed, find the minimum possible (absolute) difference between the largest number of crackers received by a user and the smallest number received by a user.

Constraints

* 1 \leq N,K \leq 100
* All values in input are integers.

Input

Input is given from Standard Input in the following format:


N K


Output

Print the minimum possible (absolute) difference between the largest number of crackers received by a user and the smallest number received by a user.

Examples

Input

7 3


Output

1


Input

100 10


Output

0


Input

1 1


Output

0
import java.util.*;

public class Main {
    public static void main(String[] args) {
        Scanner sc = new Scanner(System.in);
        String[] array = sc.nextLine().split(" ");
        if (Integer.parseInt(array[0]) % Integer.parseInt(array[1]) == 0) {
        	System.out.println("0");
        } else {
        	System.out.println("1");  
        }  
    }
}