#include <bits/stdc++.h>
using namespace std;
set<string> s;
string v;
map<string, bool> m;
void rot(string x) {
  if (m[x] == 1) return;
  m[x] = 1;
  s.erase(x);
  string y = x;
  y[0] = x[1];
  y[1] = x[2];
  y[2] = x[3];
  y[3] = x[0];
  rot(y);
  y = x;
  y[1] = x[4];
  y[4] = x[3];
  y[3] = x[5];
  y[5] = x[1];
  rot(y);
  return;
}
int main() {
  cin >> v;
  for (int i = 0; i < 1000; i++) {
    next_permutation(v.begin(), v.end());
    s.insert(v);
  }
  int ans = 0;
  while (s.size() > 0) {
    ans++;
    rot(*s.begin());
  }
  cout << ans << endl;
}
