import java.util.ArrayList;
import java.util.Arrays;
import java.util.HashSet;
import java.util.LinkedHashMap;
import java.util.LinkedList;
import java.util.Scanner;
import java.util.Set;
import java.util.TreeSet;

public class Main {
	
	public static final int SIZE = 4;
	public static final int[] vs = {1, 0, -1, 0};
	
	public static boolean is_clear(int[][] board){
		for(int i = 0; i < SIZE; i++){
			for(int j = 0; j < SIZE; j++){
				final int number = ((i * SIZE) + j + 1) % 16;
				
				if(board[i][j] != number){
					return false;
				}
			}
		}
		
		return true;
	}
	
	public static boolean has_solution(int[][] board, boolean[][] moved){
		for(int i = 0; i < SIZE; i++){
			for(int j = 0; j < SIZE; j++){
				final int number = ((i * SIZE) + j + 1) % 16;
				
				if(board[i][j] != number && moved[i][j]){
					return false;
				}
			}
		}
		
		return true;
	}
	
	
	public static boolean dfs(final int x, final int y, int[][] board, boolean[][] moved){
		if(!has_solution(board, moved)){
			return false;
		}else if(is_clear(board)){
			return true;
		}
		
		for(int v = 0; v < vs.length; v++){
			final int nx = x + vs[v];
			final int ny = y + vs[(v + 1) % vs.length];
			
			if(nx < 0 || nx >= SIZE || ny < 0 || ny >= SIZE){
				continue;
			}else if(moved[ny][nx]){
				continue;
			}
			
			{
				int tmp = board[y][x];
				board[y][x] = board[ny][nx];
				board[ny][nx] = tmp;
			}
			moved[y][x] = true;
			
			if(dfs(nx, ny, board, moved)){
				return true;
			}
			
			moved[y][x] = false;
			{
				int tmp = board[y][x];
				board[y][x] = board[ny][nx];
				board[ny][nx] = tmp;
			}
		}
		
		return false;
	}
	
	public static void main(String[] args){
		Scanner sc = new Scanner(System.in);
		
		boolean[][] moved = new boolean[SIZE][SIZE];
		int[][] board = new int[SIZE][SIZE];
		
		int sx = -1, sy = -1;
		for(int i = 0; i < SIZE; i++){
			for(int j = 0; j < SIZE; j++){
				board[i][j] = sc.nextInt();
				
				if(board[i][j] == 0){
					sx = j;
					sy = i;
				}
			}
		}
		
		System.out.println(dfs(sx, sy, board, moved) ? "Yes" : "No");
		
	}
}