Problem:
Score : 200 points

Problem Statement

There are four towns, numbered 1,2,3 and 4.
Also, there are three roads. The i-th road connects different towns a_i and b_i bidirectionally.
No two roads connect the same pair of towns. Other than these roads, there is no way to travel between these towns, but any town can be reached from any other town using these roads.

Determine if we can visit all the towns by traversing each of the roads exactly once.

Constraints

1 \leq a_i,b_i \leq 4(1\leq i\leq 3)

a_i and b_i are different. (1\leq i\leq 3)

No two roads connect the same pair of towns.

Any town can be reached from any other town using the roads.

Input

Input is given from Standard Input in the following format:

a_1 b_1
a_2 b_2
a_3 b_3

Output

If we can visit all the towns by traversing each of the roads exactly once, print YES; otherwise, print NO.

Sample Input 1

4 2
1 3
2 3

Sample Output 1

YES

We can visit all the towns in the order 1,3,2,4.

Sample Input 2

3 2
2 4
1 2

Sample Output 2

NO

Sample Input 3

2 1
3 2
4 3

Sample Output 3

YES

Solution in Ruby (2.3.3) (judge verdict: Accepted)

a = []
b = []

for i in 0..2

    a[i],b[i] = gets.split.map(&:to_i)

end

c = []
i = 0

[0, 1].repeated_permutation(4) do |bits|
    c[i] = bits 
    i += 1
end



d = []

for i in 0..15

    d[i] = 0

    if c[i].count(1) == 2 

        for j in 0..3

            if c[i][j] == 0

                if a.count(j+1)+b.count(j+1) != 1

                    d[i] = 1

                end

            else

                if a.count(j+1)+b.count(j+1) != 2

                    d[i] = 1

                end
            
            end

        end

    else

        d[i] = 1

    end

end

if d.inject(:+) == 15

    puts 'YES'

else

    puts 'NO'

end