Stuck Numbers

import java.util.Scanner;


public class Task1 {

    public static void main(String[] args) {
        Scanner sc = new Scanner(System.in);
        int n = sc.nextInt();
        int[] m = new int[n];
        for (int i = 0; i < n; i++) {
            m[i] = sc.nextInt();
        }
        boolean found = false;
        String A, B, C, D;
        String s;

        for (int a = 0; a < n; a++) {
            A = Integer.toString(m[a]);
            for (int b = 0; b < n; b++) {
                if (b == a) {
                    continue;
                }
                B = Integer.toString(m[b]);
                for (int c = 0; c < n; c++) {
                    if(c == a || c == b) {
                        continue;
                    }
                    C = Integer.toString(m[c]);
                    for (int d = 0; d < n; d++) {
                        if (d == c || d == b || d == a) {
                            continue;
                        }
                        D = Integer.toString(m[d]);
                        if ((A + B).equals(C + D)) {
                            System.out.println(A + "|" + B + "==" + C + "|" + D);
                            found = true;
                        }
                    }
                }
            }
        }
        if (!found) {
            System.out.println("No");
        }
    }

}