#include <bits/stdc++.h>
const double pi = acos(-1);
long long binpow(long long a, long long b) {
  long long res = 1;
  while (b != 0) {
    if (b & 1) res *= a, res %= 998244353;
    a *= a, a %= 998244353;
    b >>= 1;
  }
  return res % 998244353;
}
using namespace std;
int main() {
  ios_base::sync_with_stdio(false);
  cin.tie(NULL);
  vector<string> str = {"aa", "ab", "ac", "ba", "bb", "bc", "ca", "cb", "cc"};
  string s, t, ans = "", temp = "abc";
  int n;
  bool flag = 1;
  cin >> n >> s >> t;
  do {
    string check;
    if (n == 1)
      check = temp;
    else
      check = temp + temp;
    flag = 1;
    for (int i = 1; i < (int)(check.size()); i++) {
      string l = "";
      l += check[i - 1], l += check[i];
      if (l == s || l == t) {
        flag = 0;
        break;
      }
    }
    if (flag) break;
  } while (next_permutation(temp.begin(), temp.end()));
  cout << "YES\n";
  if (flag) {
    for (int i = 0; i < n; i++) cout << temp;
  } else {
    int m = 1;
    flag = 1;
    temp = "abc";
    do {
      string check = temp;
      flag = 1;
      for (int i = 1; i < (int)(check.size()); i++) {
        string l = "";
        l += check[i - 1], l += check[i];
        if (l == s || l == t) {
          flag = 0;
          break;
        }
      }
      if (flag) break;
    } while (next_permutation(temp.begin(), temp.end()));
    for (int i = 0; i < 3; i++) {
      for (int j = 0; j < n; j++) cout << temp[i];
    }
  }
}
