package chelper;

import java.util.ArrayList;
import java.util.List;

import io.InputReader;
import io.OutputWriter;
import misc.GCJSolution;
import misc.SimpleSavingChelperSolution;


public class TaskС extends GCJSolution {

  public void solve(int testNumber, InputReader in, OutputWriter out) {
    wrapSolve(testNumber, in, out);
  }

  int l;

  @Override
  public void solve(int testNumber) {
    l = in.nextInt();

    char[] ac = in.nextString().toCharArray();
    char[] bc = in.nextString().toCharArray();
    char[] cc = in.nextString().toCharArray();

    int[] a = new int[l];
    int[] b = new int[l];
    int[] c = new int[l];

    for (int i = 0; i < l; i++) {
      a[i] = ac[i] - 'A';
      b[i] = bc[i] - 'A';
      c[i] = cc[i] - 'A';
    }

    boolean ok1 = possible(b, a, c) || possible(c, a, b);
    boolean ok2 = possible(a, b, c) || possible(c, b, a);
    boolean ok3 = possible(a, c, b) || possible(b, c, a);

    out.print(ok1 ? "YES" : "NO");
    out.print(" ");
    out.print(ok2 ? "YES" : "NO");
    out.print(" ");
    out.print(ok3 ? "YES" : "NO");
    out.println();
  }

  boolean possible(int[] a, int[] b, int[] c) {
    int a0 = -1;
    int a1 = -1;
    int b0 = -1;
    int b1 = -1;

    for (int i = 0; i < l; i++) {
      if (a[i] != b[i]) {
        a0 = a[i];
        a1 = b[i];
        break;
      }
    }

    for (int i = 0; i < l; i++) {
      if (b[i] != c[i]) {
        b0 = b[i];
        b1 = c[i];
        break;
      }
    }

    return !(a0 == b1 && a1 == b0);
  }
}