using System; using System.Linq; using Internal; using System.Collections.Generic; using System.Text; class Scanner { string[] s; int i; char[] cs = new char[] { ' ' }; public Scanner() { s = new string[0]; i = 0; } public string Next() { if (i < s.Length) return s[i++]; string st = Console.ReadLine(); while (st == "") st = Console.ReadLine(); s = st.Split(cs, StringSplitOptions.RemoveEmptyEntries); if (s.Length == 0) return Next(); i = 0; return s[i++]; } public int NextInt() { return int.Parse(Next()); } public long NextLong() { return long.Parse(Next()); } public double NextDouble() { return double.Parse(Next()); } public ulong NextUlong() { return ulong.Parse(Next()); } public decimal NextDecimal() { return decimal.Parse(Next()); } public int[] ArrayInt(int N, int add = 0) { int[] Array = new int[N]; for (int i = 0; i < N; i++) { Array[i] = NextInt() + add; } return Array; } public double[] ArrayDouble(int N, double add = 0) { double[] Array = new double[N]; for (int i = 0; i < N; i++) { Array[i] = NextDouble() + add; } return Array; } public long[] ArrayLong(long N, long add = 0) { long[] Array = new long[N]; for (long i = 0; i < N; i++) { Array[i] = NextLong() + add; } return Array; } } class Program { static void Main() { const int MOD = 998244353; Scanner sc = new Scanner(); string s = sc.Next(); int n = s.Length; int q = 0; for (int i = 0; i < n; i++) { if (s[i] == '?') { q++; } } long ans = 0; for (int i = 0; i < (1 << q); i++) { char[] t = s.ToCharArray(); for (int j = 0; j < q; j++) { if (((i >> j) & 1) == 0) { t[GetIndexOfQuestionMark(s, j)] = '0'; } else { t[GetIndexOfQuestionMark(s, j)] = '1'; } } string sPrime = new string(t); ans = (ans + Count010Substrings(sPrime)) % MOD; } Console.WriteLine(ans); } static int GetIndexOfQuestionMark(string s, int qIndex) { int count = -1; for (int i = 0; i < s.Length; i++) { if (s[i] == '?') { count++; if (count == qIndex) { return i; } } } return -1; } static long Count010Substrings(string s) { int n = s.Length; int[] preSum = new int[n + 1]; preSum[0] = 0; for (int i = 1; i <= n; i++) { preSum[i] = preSum[i - 1] + (s[i - 1] == '0' ? 1 : 0); } long ans = 0; int num10 = 0; for (int i = n - 1; i >= 0; i--) { if (s[i] == '1') { num10 += preSum[n] - preSum[i + 1]; } else if (s[i] == '0') { ans += num10; } } return ans; } }