Seed finding

public class perfect {
    static int f(int x) {
        x ^= x << 13;
        x ^= x >> 17;
        x ^= x << 15;
        return x;
    }
    static int rem1(int x){
        x = Math.abs(x);
        x = x%10000;
        if(x > 9500) {
            return 2;
        }else if (x>7500) {
            return 1;
        }else{
            return 0;
        }
    }
    static int rem2(int r,int y){
        y = Math.abs(y);
        if(r==2){
            return y%6;
        }else if (r==1){
            return y%16;
        }else {
            return y%23;
        }
    }

    public static void main(String[] args){
        int[][] array = {{0,3},{0,5},{0,0},{0,13},{0,2},{0,5},{0,18},{1,2},{0,22},{1,1}};
        for (int i=-2147483647;i<2147483647;i++){
            int seed = i;
            int j = 0;
            boolean Running = true;
            while(j<10 && Running){
                int rarity = rem1(seed);
                seed = f(seed);
                int slot = rem2(rarity,seed);
                if (rarity != array[j][0]) {
                    Running = false;
                }
                if (slot != array[j][1]) {
                    Running = false;
                }
                seed = f(seed);
                if (j==9){
                    System.out.println(i);
                    System.out.println("This is it");
                }
                j ++;
            }
        }
    }
}