(SPOJ) 20000 - Gangorra - Solução

import java.io.*;
import java.util.*;

class Main {
    public static void main(String[] args) throws NumberFormatException, IOException {

        Main processando = new Main();
        processando.processa();

        System.exit(0);
    }

    static int leitor(BufferedReader br) throws NumberFormatException, IOException {
        int n;
        int resp = 0;

        while (true) {
            n = br.read();
            if (n >= '0' && n <= '9') break;
        }
        while (true) {
            resp = resp*10 + n-'0';
            n = br.read();
            if (n < '0' || n > '9') break;
        }

        return resp;
    }

    void processa() throws NumberFormatException, IOException {
        BufferedReader br = new BufferedReader(new InputStreamReader(System.in));
        BufferedWriter bw = new BufferedWriter(new OutputStreamWriter(System.out));
       
        int res1 = leitor(br) * leitor(br);
        int res2 = leitor(br) * leitor(br);           

        if (res1 == res2) {
            bw.write("0\n");
        }
        else if (res1 > res2) {
            bw.write("-1\n");
        }
        else {
            bw.write("1\n");   
        }

        bw.flush();
        bw.close();          

        return;
    }
}