In the city of Ultima Thule job applicants are often offered an IQ test. 

The test is as follows: the person gets a piece of squared paper with a 4 × 4 square painted on it. Some of the square's cells are painted black and others are painted white. Your task is to repaint at most one cell the other color so that the picture has a 2 × 2 square, completely consisting of cells of the same color. If the initial picture already has such a square, the person should just say so and the test will be completed. 

Your task is to write a program that determines whether it is possible to pass the test. You cannot pass the test if either repainting any cell or no action doesn't result in a 2 × 2 square, consisting of cells of the same color.

Input

Four lines contain four characters each: the j-th character of the i-th line equals "." if the cell in the i-th row and the j-th column of the square is painted white, and "#", if the cell is black.

Output

Print "YES" (without the quotes), if the test can be passed and "NO" (without the quotes) otherwise.

Examples

Input

####
.#..
####
....


Output

YES


Input

####
....
####
....


Output

NO

Note

In the first test sample it is enough to repaint the first cell in the second row. After such repainting the required 2 × 2 square is on the intersection of the 1-st and 2-nd row with the 1-st and 2-nd column.
/**
 * TEAM: BROGRAMMERS
 */
import java.io.*;
import java.util.*;
import static java.lang.Math.*;
public class ProblemA {
    void run() {
        d("This is a debugging line.");
        FastScanner sc = new FastScanner(System.in);
		char grid[][] = new char[4][4];
		for (int x = 0; x < 4; ++x) {
			String row = sc.nextLine();
			for (int y = 0; y < 4; ++y) {
				grid[x][y] = row.charAt(y);
			}
		}
        char valid[] = new char[]{'#','.'};
		for (char c: valid) {
		for (int y = 0; y < 3; ++y) {
			for (int x = 0; x < 3; ++x) {
				if (grid[y][x] == c && grid[y][x+1] == c) {
					if (grid[y+1][x] == c || grid[y+1][x+1] == c) {
						p("YES\n");
						return;
					}
				}

				if (grid[y+1][x] == c && grid[y+1][x+1] == c) {
					if (grid[y][x] == c || grid[y][x+1] == c) {
						p("YES\n");
						return;
					}
				}
			}
		}
		}

		p("NO\n");
    }

    boolean debug = false;
    void p(String f, Object...params) {
        System.out.printf(f, params);
    }
    void d(Object...params) {
        if (debug) {
            p("DEBUG: %s\n", Arrays.deepToString(params));
        }
    }
    static void die() {
        throw new RuntimeException();
    }
    public ProblemA(String[] args) {
        if (args.length > 0 && args[0].equals("debug")) {
            debug = true;
        }
    }
    public static void main(String[] args) {
        new ProblemA(args).run();
    }

    private static class FastScanner {
      private BufferedReader in;
      private StringTokenizer tok;
      public FastScanner(InputStream inputstream) {
        in = new BufferedReader(new InputStreamReader(inputstream));
        tok = null;
      }
      private void tokenizeLine() {
        try {
          String line = in.readLine();
          if (line == null) die();
          tok = new StringTokenizer(line);
        } catch (IOException e) {
          die();
        }
      }
      public String next() {
        while (tok == null || !tok.hasMoreTokens()) {
          tokenizeLine();
        }
        return tok.nextToken();
      }
      public boolean hasNextLine() {
        if (tok == null) {
          try {
            tokenizeLine();
          }
          catch (Exception e) {
            return false;
          }
        }
        return true;
      }
      public String nextLine() {
        if (tok == null) {
          tokenizeLine();
        }
        String ret = tok.hasMoreTokens() ? tok.nextToken("\n"): "";
        tok = null;
        return ret;
      }
      public int nextInt() {
        return Integer.parseInt(next());
      }
      public long nextLong() {
        return Long.parseLong(next());
      }
      public double nextDouble() {
        return Double.parseDouble(next());
      }
    }
}
