int numA =1;
        int numB = 1;
        for (int i = 1; i < 1000; i++){
            for (int j = 1; j < 1000; j++){
                (i + j + Math.sqrt((i^2) + (j^2))) == numA;
            }

        }
        /*while (((1000 * ((1000 - (2 * num))/(2 *(1000 * num)))) %  1) != 0){
          num++;
        }*/
        return numA;