#include <bits/stdc++.h>
//#include <atcoder/all>
#ifndef LOCAL
#pragma GCC target("arch=skylake-avx512")
#pragma GCC optimize("O3")
#pragma GCC optimize("unroll-loops")
#endif
using namespace std;

typedef long long ll;
typedef unsigned int uint;
typedef unsigned long long ull;
static const double EPS = 1e-12;
static const double PI = acos(-1.0);

#define FOR(i, a, b) for (int i = (int)(a); i < (int)(b); i++)
#define REP(i, n) for (int i = 0; i < (int)(n); i++)
#define ALL(a) (a).begin(), (a).end()
#ifdef LOCAL
#define dbg(x) cerr << __LINE__ << " : " << #x << " = " << (x) << endl
#else
#define dbg(x) true
#endif

ll f(ll n) {
  ll ans = 1;
  FOR(i, 1, n + 1) {
    ans *= i;
  }
  return ans;
}

ll ncr(ll n, ll r) {
  return f(n) / (f(r) * f(n - r));
}

ll mypow(ll n, ll x) {
  ll ans = 1;
  REP(i, x) {
    ans *= n;
  }
  return ans;
}

void solve(std::string S) {
  ll ans = 0;
  REP(j, 10000) {
    int i = j;
    int x0 = i % 10;
    i /= 10;
    int x1 = i % 10;
    i /= 10;
    int x2 = i % 10;
    i /= 10;
    int x3 = i % 10;
    i /= 10;
    if (S[x0] == 'x') {
      continue;
    }
    if (S[x1] == 'x') {
      continue;
    }
    if (S[x2] == 'x') {
      continue;
    }
    if (S[x3] == 'x') {
      continue;
    }
    set<int> s;
    s.insert(x0);
    s.insert(x1);
    s.insert(x2);
    s.insert(x3);
    bool ok = true;
    REP(i, S.size()) {
      if (S[i] == 'o') {
        if (s.find(i) != s.end()) {
          s.erase(i);
        } else {
          ok = false;
        }
      }
    }
    if (ok) {
      ans++;
    }
  }
  cout << ans << endl;
}

int main() {
  std::string S;
  std::cin >> S;
  solve(S);
  return 0;
}

#pragma GCC optimize ("Ofast")
#include<bits/stdc++.h>
using namespace std;
inline int my_getchar_unlocked(){
  static char buf[1048576];
  static int s = 1048576;
  static int e = 1048576;
  if(s == e && e == 1048576){
    e = fread_unlocked(buf, 1, 1048576, stdin);
    s = 0;
  }
  if(s == e){
    return EOF;
  }
  return buf[s++];
}
inline void rd(int &x){
  int k;
  int m=0;
  x=0;
  for(;;){
    k = my_getchar_unlocked();
    if(k=='-'){
      m=1;
      break;
    }
    if('0'<=k&&k<='9'){
      x=k-'0';
      break;
    }
  }
  for(;;){
    k = my_getchar_unlocked();
    if(k<'0'||k>'9'){
      break;
    }
    x=x*10+k-'0';
  }
  if(m){
    x=-x;
  }
}
struct MY_WRITER{
  char buf[1048576];
  int s;
  int e;
  MY_WRITER(){
    s = 0;
    e = 1048576;
  }
  ~MY_WRITER(){
    if(s){
      fwrite_unlocked(buf, 1, s, stdout);
    }
  }
}
;
MY_WRITER MY_WRITER_VAR;
void my_putchar_unlocked(int a){
  if(MY_WRITER_VAR.s == MY_WRITER_VAR.e){
    fwrite_unlocked(MY_WRITER_VAR.buf, 1, MY_WRITER_VAR.s, stdout);
    MY_WRITER_VAR.s = 0;
  }
  MY_WRITER_VAR.buf[MY_WRITER_VAR.s++] = a;
}
inline void wt_L(char a){
  my_putchar_unlocked(a);
}
inline void wt_L(int x){
  int s=0;
  int m=0;
  char f[10];
  if(x<0){
    m=1;
    x=-x;
  }
  while(x){
    f[s++]=x%10;
    x/=10;
  }
  if(!s){
    f[s++]=0;
  }
  if(m){
    my_putchar_unlocked('-');
  }
  while(s--){
    my_putchar_unlocked(f[s]+'0');
  }
}
inline void wt_L(const char c[]){
  int i=0;
  for(i=0;c[i]!='\0';i++){
    my_putchar_unlocked(c[i]);
  }
}
template<class S, class T> inline S chmin(S &a, T b){
  if(a>b){
    a=b;
  }
  return a;
}
template<class T, class S> int subsetSum(int n, T a[], S res[]){
  int i;
  int k;
  int sz = 1;
  res[0] = 0;
  for(k=(0);k<(n);k++){
    for(i=(0);i<(sz);i++){
      res[sz+i] = res[i] + a[k];
    }
    sz *= 2;
  }
  return sz;
}
int N;
int A[200];
long long s[256];
int sz;
int ind[8];
int main(){
  int m1;
  rd(N);
  {
    int Lj4PdHRW;
    for(Lj4PdHRW=(0);Lj4PdHRW<(N);Lj4PdHRW++){
      rd(A[Lj4PdHRW]);
    }
  }
  chmin(N, 8);
  subsetSum(N, A, s);
  for(m1=(1);m1<(1<<N);m1++){
    int m2;
    for(m2=(m1+1);m2<(1<<N);m2++){
      if(s[m1]%200==s[m2]%200){
        int i;
        wt_L("Yes");
        wt_L('\n');
        sz = 0;
        for(i=(0);i<(N);i++){
          if(((m1) &(1<<(i)))){
            ind[sz++] = i;
          }
        }
        wt_L(sz);
        wt_L(' ');
        {
          int t_ynMSdg;
          if(sz==0){
            wt_L('\n');
          }
          else{
            for(t_ynMSdg=(0);t_ynMSdg<(sz-1);t_ynMSdg++){
              wt_L(ind[t_ynMSdg]+1);
              wt_L(' ');
            }
            wt_L(ind[t_ynMSdg]+1);
            wt_L('\n');
          }
        }
        sz = 0;
        for(i=(0);i<(N);i++){
          if(((m2) &(1<<(i)))){
            ind[sz++] = i;
          }
        }
        wt_L(sz);
        wt_L(' ');
        {
          int hCmBdyQB;
          if(sz==0){
            wt_L('\n');
          }
          else{
            for(hCmBdyQB=(0);hCmBdyQB<(sz-1);hCmBdyQB++){
              wt_L(ind[hCmBdyQB]+1);
              wt_L(' ');
            }
            wt_L(ind[hCmBdyQB]+1);
            wt_L('\n');
          }
        }
        return 0;
      }
    }
  }
  wt_L("No");
  wt_L('\n');
  return 0;
}
// cLay version 20210508-1 [beta]

// --- original code ---
// int N, A[200]; ll s[256];
// int sz, ind[8];
// {
//   rd(N,A(N));
//   N <?= 8;
//   subsetSum(N, A, s);
//   rep(m1,1,1<<N) rep(m2,m1+1,1<<N) if(s[m1]%200==s[m2]%200){
//     wt("Yes");
// 
//     sz = 0;
//     rep(i,N) if(BIT_ith(m1,i)) ind[sz++] = i;
//     wt(sz, ind(sz)+1);
// 
//     sz = 0;
//     rep(i,N) if(BIT_ith(m2,i)) ind[sz++] = i;
//     wt(sz, ind(sz)+1);
//     return 0;
//   }
//   wt("No");
// 
// }
