#include <bits/stdc++.h>
using namespace std;
int m = 1e9 + 7;
int main() {
  long long fb[100001];
  fb[0] = 1;
  fb[1] = 1;
  for (int i = 2; i < 1e5 + 1; i++) {
    fb[i] = fb[i - 1] + fb[i - 2];
    fb[i] = fb[i] % m;
  }
  string str;
  cin >> str;
  long long ans = 1, cnt = 1;
  int n = str.length();
  for (int i = 1; i < str.length(); i++)
    if (str[i - 1] == 'm' || str[i - 1] == 'w' || str[i - 1] < 'a' ||
        str[i - 1] > 'z') {
      ans = 0;
      break;
    } else if (str[i - 1] == 'u' && str[i] == 'u')
      cnt++;
    else if (str[i - 1] == 'n' && str[i] == 'n')
      cnt++;
    else {
      ans = ((ans)*fb[cnt]) % m;
      cnt = 1;
    }
  ans = ((ans)*fb[cnt]) % m;
  if (str[n - 1] == 'm' || str[n - 1] == 'w' || str[n - 1] < 'a' ||
      str[n - 1] > 'z') {
    ans = 0;
  }
  cout << ans % m;
}
