using System;
using System.Collections.Generic;
using System.Linq;
using System.Text;
using System.Threading;
using System.Threading.Tasks;

namespace Binary_Search
{
    class Program
    {
        static void Main(string[] args)
        {
            List <int> numbers = Console.ReadLine().Split(' ').Select(int.Parse).ToList();
            int numberTofind = int.Parse(Console.ReadLine());

            int countLinearsearch = LinearSearch(numbers, numberTofind);
            int countBinarySearh = BinarySearch(numbers, numberTofind);

            if (countLinearsearch < numbers.Count)
            {
                Console.WriteLine("Yes");
            }
            else
            {
                Console.WriteLine("No");
            }

            Console.WriteLine("Linear search made {0} iterations", countLinearsearch);
            Console.WriteLine("Binary search made {0} iterations", countBinarySearh);

        }

        private static int BinarySearch(List<int> numbers, int numberTofind)
        {
            int count = 0;

            numbers.Sort();
            int min = numbers[0];
            int max = numbers.Count-1;

            while (min <= max)
            {
                int midPoint = (min + max) / 2;
                count++;
                if (numbers[midPoint] < numberTofind)
                {
                    min = midPoint + 1;
                }
                if (numbers[midPoint] > numberTofind)
                {
                    max = midPoint - 1;
                }
                if (numbers[midPoint] == numberTofind)
                {
                    break;
                }

            }


            return count;
        }

        private static int LinearSearch(List<int> numbers, int numberTofind)
        {
            int count = 0;

            for (int i = 0; i < numbers.Count; i++)
            {
                count++;
                if (numbers[i] == numberTofind)
                {
                    return count;
                }
            }

            return count;
        }
    }
}