#include <bits/stdc++.h>
using namespace std;
const int mod = 998244353;
struct Edge {
  int go, next;
} e[80010];
int head[8010], tot, col[8010];
long long pw[4010];
void add(int x, int y) {
  e[++tot].go = y;
  e[tot].next = head[x];
  head[x] = tot;
}
void da(int x, int y) {
  add(x, y);
  add(y, x);
}
void init() {
  memset(head, 0, sizeof(head));
  memset(col, 0, sizeof(col));
  tot = 0;
}
char a[1010];
bool dfs(int x, int t) {
  col[x] = t;
  for (int i = head[x]; i; i = e[i].next) {
    int v = e[i].go;
    if (col[v] == 0) {
      bool f = dfs(v, -t);
      if (!f) return false;
    } else if (col[v] == t)
      return false;
  }
  return true;
}
int one = 8001;
int main() {
  scanf("%s", a + 1);
  int n = strlen(a + 1);
  pw[0] = 1;
  for (int i = 1; i <= 4000; i++) pw[i] = pw[i - 1] * 2 % mod;
  long long ans = 0;
  for (int i = 1; i < n; i++) {
    init();
    int cnt = n + i;
    for (int j = 1; j <= n; j++) {
      da(j, ++cnt);
      da(cnt, n + 1 - j);
      if (j <= i) {
        da(n + j, ++cnt);
        da(cnt, n + (i + 1 - j));
        if (a[n + 1 - j] == '0') {
          da(j, ++cnt);
          da(cnt, n + j);
        }
        if (a[n + 1 - j] == '1') {
          da(j, n + j);
        }
      } else {
        if (a[n + 1 - j] == '0') da(j, one);
        if (a[n + 1 - j] == '1') da(j, 0);
      }
    }
    da(n + 1, 0);
    da(0, one);
    int c = 0;
    bool fl = 1;
    fl &= dfs(one, 1);
    for (int j = 1; j <= n + i; j++) {
      if (col[j]) continue;
      fl &= dfs(j, 1);
      if (!fl) break;
      c++;
    }
    if (fl) ans = (ans + pw[c]) % mod;
  }
  printf("%lld", ans);
  return 0;
}
