using System; using System.Collections.Generic; using System.Linq; using System.Text; using System.Threading.Tasks; namespace ProgrammingContest { class MainClass { Scanner sc; static void Main(string[] args) { new MainClass().Solve(); } const bool DEBUG = false; // TODO: must check!! void Solve() { if (DEBUG) { string backPath = ".."; char dirSep = System.IO.Path.DirectorySeparatorChar; string inFilePath = backPath + dirSep + backPath + dirSep + "in.txt"; sc = new Scanner(new System.IO.StreamReader(inFilePath)); } else { sc = new Scanner(); } for (int i = 0; i < 4; i++) { for (int j = 0; j < 4; j++) { a[i, j] = abuf[i, j] = sc.NextInt; perfect[i, j] = (i * 4 + j + 1) % 16; } } bool ok = false; for (int i = 0; i < 4; i++) { for (int j = 0; j < 4; j++) { ok |= dfs(i, j); Array.Copy(abuf, a, a.Length); } } Console.WriteLine(ok ? "Yes" : "No"); } bool dfs(int x, int y) { //outAr(a); bool res = false; for (int i = 0; i < 4; i++) { int nx = x + dx[i]; int ny = y + dy[i]; if (inside(nx, ny) && a[nx, ny] == perfect[x, y] && (a[x, y] == 0 || a[nx, ny] == 0)) { int buf = a[x, y]; a[x, y] = a[nx, ny]; a[nx, ny] = buf; res |= dfs(nx, ny); } } return res || check(a); } int[,] a = new int[4, 4]; int[,] abuf = new int[4, 4]; int[,] perfect = new int[4, 4]; int[] dx = { 0, -1, 0, 1}; int[] dy = { -1, 0, 1, 0}; void outAr(int[,] ar) { Console.WriteLine(); for (int i = 0; i < 4; i++) { for (int j = 0; j < 4; j++) { Console.Write(a[i, j] + " "); } Console.WriteLine(); } } bool inside(int x, int y) { return 0 <= x && x < 4 && 0 <= y && y < 4; } bool check(int[,] ar) { for (int i = 0; i < 4; i++) { for (int j = 0; j < 4; j++) { if (perfect[i, j] != ar[i, j]) { return false; } } } return true; } } class Scanner { Queue buffer; char[] sep; System.IO.TextReader reader; public Scanner(System.IO.TextReader reader = null) { this.buffer = new Queue(); this.sep = new char[] { ' ' }; this.reader = (reader ?? Console.In); } private void CheckBuffer() { if (this.buffer.Count == 0) { String[] sreArray = this.reader.ReadLine().Split(this.sep); foreach (String elStr in sreArray) { this.buffer.Enqueue(elStr); } } } public String Next { get { this.CheckBuffer(); return this.buffer.Dequeue(); } } public int NextInt { get { return int.Parse(this.Next); } } public double NextDouble { get { return double.Parse(this.Next); } } public long NextLong { get { return long.Parse(this.Next); } } public bool IsEmpty { get { this.CheckBuffer(); return this.buffer.Count == 0; } } } }