import std.stdio, std.conv, std.array, std.string, std.algorithm, std.container, std.range, core.stdc.stdlib, std.math, std.typecons;
T[][] combinations(T)(T[] s, in int m) {   if (!m) return [[]];   if (s.empty) return [];   return s[1 .. $].combinations(m - 1).map!(x => s[0] ~ x).array ~ s[1 .. $].combinations(m); }

void main() {
  auto N = readln.split.to!(ulong[]);

  string solve() {
    if (N[0] == N[1] && N[0] == N[2]) return "No";
    if (N[0] != N[1] && N[1] != N[2] && N[0] != N[2]) return "No";
    return "Yes";
  }

  solve().writeln;
}
