using System;
using static System.Console;
using System.Linq;
using System.Collections.Generic;

class Program
{
    static int NN => int.Parse(ReadLine());
    static int[] NList => ReadLine().Split().Select(int.Parse).ToArray();
    static int[] NMi => ReadLine().Split().Select(c => int.Parse(c) - 1).ToArray();
    static int[][] NMap(int n) => Enumerable.Repeat(0, n).Select(_ => NMi).ToArray();
    public static void Main()
    {
        Solve();
    }
    static void Solve()
    {
        var c = NList;
        var (n, m) = (c[0], c[1]);
        var map = NMap(m);
        var tree = new HashSet<int>[n];
        for (var i = 0; i < tree.Length; ++i) tree[i] = new HashSet<int>();
        foreach (var edge in map)
        {
            tree[edge[0]].Add(edge[1]);
            tree[edge[1]].Add(edge[0]);
        }
        var ans = 0;
        var q = new Queue<int>();
        for (var i = 0; i < n; ++i) if (tree[i].Count == 1) q.Enqueue(i);
        while (q.Count > 0)
        {
            var cur = q.Dequeue();
            if (tree[cur].Count != 1) continue;
            var list = new List<int>(tree[cur]);
            foreach (var li in list)
            {
                tree[cur].Remove(li);
                tree[li].Remove(cur);
                ++ans;
                if (tree[li].Count == 1) q.Enqueue(li);
            }
        }
        WriteLine(ans % 2 == 1 ? "Yes" : "No");
    }
}