#include <bits/stdc++.h>
using namespace std;
long long ceill(long long a, long long b) { return a / b + bool(a % b); }
long long gcd(long long a, long long b) {
  if (b == 0) return a;
  return gcd(b, a % b);
}
long long power(long long x, long long y) {
  long long res = 1;
  while (y > 0) {
    if (y & 1) res = (res * x) % 1000000007;
    x = (x * x) % 1000000007;
    y >>= 1;
  }
  return res;
}
bool isPrime(long long n) {
  if (n <= 1) return false;
  if (n <= 3) return true;
  if (n % 2 == 0 || n % 3 == 0) return false;
  for (long long i = 5; i * i <= n; i = i + 6)
    if (n % i == 0 || n % (i + 2) == 0) return false;
  return true;
}
void primeFactors(long long n, vector<long long> &vec) {
  while (n % 2 == 0) vec.push_back(2), n /= 2;
  for (long long i = 3; i <= sqrt(n); i += 2)
    while (n % i == 0) vec.push_back(i), n /= i;
  if (n > 2) vec.push_back(n);
}
void solve() {
  string str1, str2;
  cin >> str1 >> str2;
  long long n1 = str1.size(), n2 = str2.size();
  if (n1 != n2) {
    cout << "No" << '\n';
    return;
  }
  set<char> sett = {'a', 'e', 'i', 'o', 'u'};
  for (long long i = 0; i < n1; i++) {
    if (str1[i] != str2[i]) {
      if ((sett.find(str1[i]) != sett.end() &&
           sett.find(str2[i]) == sett.end()) ||
          (sett.find(str1[i]) == sett.end() &&
           sett.find(str2[i]) != sett.end())) {
        cout << "No" << '\n';
        return;
      }
    }
  }
  cout << "Yes" << '\n';
}
signed main() {
  ios_base::sync_with_stdio(false);
  cin.tie(NULL);
  long long tc = 1;
  for (long long TTT = 1; TTT <= tc; TTT++) {
    solve();
  }
}
