using System; using System.Linq; using System.Diagnostics; using System.Collections.Generic; using Debug = System.Diagnostics.Debug; using StringBuilder = System.Text.StringBuilder; using System.Numerics; namespace Program { public class Solver { public void Solve() { var s = sc.Scan(); //s = Enumerable.Repeat('?', 100).AsString(); var n = s.Length; var ns = new List(); foreach (var x in s) if ("KUROI?".Contains(x)) ns.Add(x); s = ns.AsString(); n = s.Length; var dp = new int[n + 1, 194500]; for (int i = 0; i <= n; i++) for (int j = 0; j < 194500; j++) dp[i, j] = -1; var width = new int[4]; width[0] = 1; for (int i = 1; i < 4; i++) width[i] = width[i - 1] * 21; Func dfs = null; dfs = (pos, otaku) => { if (pos == n) return 0; var o = otaku / width[3]; var t = (otaku / width[2]) % 21; var a = (otaku / width[1]) % 21; var k = otaku % 21; if (dp[pos, otaku] != -1) return dp[pos, otaku]; var res = dfs(pos + 1, otaku); if (s[pos] == 'K' || s[pos] == '?' && o < 20) res = Math.Max(res, dfs(pos + 1, (o + 1) * width[3] + t * width[2] + a * width[1] + k)); if ((s[pos] == 'U' || s[pos] == '?') && o > 0 && t < 20) res = Math.Max(res, dfs(pos + 1, (o - 1) * width[3] + (t + 1) * width[2] + a * width[1] + k)); if ((s[pos] == 'R' || s[pos] == '?') && t > 0 && a < 20) res = Math.Max(res, dfs(pos + 1, o * width[3] + (t - 1) * width[2] + (a + 1) * width[1] + k)); if ((s[pos] == 'O' || s[pos] == '?') && a > 0 && k < 20) res = Math.Max(res, dfs(pos + 1, o * width[3] + t * width[2] + (a - 1) * width[1] + k + 1)); if ((s[pos] == 'I' || s[pos] == '?') && k > 0) res = Math.Max(res, dfs(pos + 1, (o + 1) * width[3] + t * width[2] + a * width[1] + k - 1) + 1); return dp[pos, otaku] = res; }; var ans = dfs(0, 0); IO.Printer.Out.WriteLine(ans); } public IO.StreamScanner sc = new IO.StreamScanner(Console.OpenStandardInput()); static T[] Enumerate(int n, Func f) { var a = new T[n]; for (int i = 0; i < n; ++i) a[i] = f(i); return a; } static public void Swap(ref T a, ref T b) { var tmp = a; a = b; b = tmp; } } } #region main static class Ex { static public string AsString(this IEnumerable ie) { return new string(System.Linq.Enumerable.ToArray(ie)); } static public string AsJoinedString(this IEnumerable ie, string st = " ") { return string.Join(st, ie); } static public void Main() { var solver = new Program.Solver(); solver.Solve(); Program.IO.Printer.Out.Flush(); } } #endregion #region Ex namespace Program.IO { using System.IO; using System.Text; using System.Globalization; public class Printer : StreamWriter { static Printer() { Out = new Printer(Console.OpenStandardOutput()) { AutoFlush = false }; } public static Printer Out { get; set; } public override IFormatProvider FormatProvider { get { return CultureInfo.InvariantCulture; } } public Printer(System.IO.Stream stream) : base(stream, new UTF8Encoding(false, true)) { } public Printer(System.IO.Stream stream, Encoding encoding) : base(stream, encoding) { } public void Write(string format, T[] source) { base.Write(format, source.OfType().ToArray()); } public void WriteLine(string format, T[] source) { base.WriteLine(format, source.OfType().ToArray()); } } public class StreamScanner { public StreamScanner(Stream stream) { str = stream; } public readonly Stream str; private readonly byte[] buf = new byte[1024]; private int len, ptr; public bool isEof = false; public bool IsEndOfStream { get { return isEof; } } private byte read() { if (isEof) return 0; if (ptr >= len) { ptr = 0; if ((len = str.Read(buf, 0, 1024)) <= 0) { isEof = true; return 0; } } return buf[ptr++]; } public char Char() { byte b = 0; do b = read(); while ((b < 33 || 126 < b) && !isEof); return (char)b; } public string Scan() { var sb = new StringBuilder(); for (var b = Char(); b >= 33 && b <= 126; b = (char)read()) sb.Append(b); return sb.ToString(); } public string ScanLine() { var sb = new StringBuilder(); for (var b = Char(); b != '\n'; b = (char)read()) if (b == 0) break; else if (b != '\r') sb.Append(b); return sb.ToString(); } public long Long() { if (isEof) return long.MinValue; long ret = 0; byte b = 0; var ng = false; do b = read(); while (b != '-' && (b < '0' || '9' < b)); if (b == '-') { ng = true; b = read(); } for (; true; b = read()) { if (b < '0' || '9' < b) return ng ? -ret : ret; else ret = ret * 10 + b - '0'; } } public int Integer() { return (isEof) ? int.MinValue : (int)Long(); } public double Double() { return double.Parse(Scan(), CultureInfo.InvariantCulture); } private T[] enumerate(int n, Func f) { var a = new T[n]; for (int i = 0; i < n; ++i) a[i] = f(); return a; } public char[] Char(int n) { return enumerate(n, Char); } public string[] Scan(int n) { return enumerate(n, Scan); } public double[] Double(int n) { return enumerate(n, Double); } public int[] Integer(int n) { return enumerate(n, Integer); } public long[] Long(int n) { return enumerate(n, Long); } } } #endregion #region HashMap public class HashMap : Dictionary //where V : new() { public HashMap() : base() { } public HashMap(int cap) : base(cap) { } new public V this[K i] { get { V v; return TryGetValue(i, out v) ? v : base[i] = default(V); //base[i] = new V(); } set { base[i] = value; } } } #endregion struct otaku { public int k, u, r, o; public otaku(int[] a) { k = a[0]; u = a[1]; r = a[2]; o = a[3]; } }