During the breaks between competitions, top-model Izabella tries to develop herself and not to be bored. For example, now she tries to solve Rubik's cube 2x2x2. It's too hard to learn to solve Rubik's cube instantly, so she learns to understand if it's possible to solve the cube in some state using 90-degrees rotation of one face of the cube in any direction. To check her answers she wants to use a program which will for some state of cube tell if it's possible to solve it using one rotation, described above. Cube is called solved if for each face of cube all squares on it has the same color. https://en.wikipedia.org/wiki/Rubik's_Cube In first line given a sequence of 24 integers a i ( 1 ≤ a i ≤ 6 ), where a i denotes color of i -th square. There are exactly 4 occurrences of all colors in this sequence. Print « YES » (without quotes) if it's possible to solve cube using one rotation and « NO » (without quotes) otherwise. In first test case cube looks like this: In second test case cube looks like this: It's possible to solve cube by rotating face with squares with numbers 13, 14, 15, 16.