#include <algorithm>
#include <bitset>
#include <cassert>
#include <chrono>
#include <climits>
#include <cmath>
#include <complex>
#include <cstring>
#include <deque>
#include <functional>
#include <iostream>
#include <iomanip>
#include <list>
#include <map>
#include <numeric>
#include <queue>
#include <random>
#include <set>
#include <stack>
#include <unordered_map>
#include <unordered_set>
#include <vector>
#include <cstdint>
using namespace std;
typedef long long ll;
typedef vector<int> vi;
typedef pair<int,int> pii;
#define MP make_pair
#define PB push_back
#define inf 1000000007
#define rep(i,n) for(int i = 0; i < (int)(n); ++i)
#define all(x) (x).begin(),(x).end()

template<typename A, size_t N, typename T>
void Fill(A (&array)[N], const T &val){
    std::fill( (T*)array, (T*)(array+N), val );
}
 
template<class T> inline bool chmax(T &a, T b){
    if(a<b){
        a = b;
        return true;
    }
    return false;
}

template<class T> inline bool chmin(T &a, T b){
    if(a>b){
        a = b;
        return true;
    }
    return false;
}

template <unsigned int mod>
class ModInt {
private:
    unsigned int v;
    static unsigned int norm(const unsigned int& x){ return x < mod ? x : x - mod; }
    static ModInt make(const unsigned int& x){ ModInt m; return m.v = x, m; }
    static ModInt inv(const ModInt& x){ return make(inverse(x.v, mod)); }
    static unsigned int inverse(int a, int m){
        int u[] = {a, 1, 0}, v[] = {m, 0, 1}, t;
        while(*v){
            t = *u / *v;
            swap(u[0] -= t * v[0], v[0]), swap(u[1] -= t * v[1], v[1]), swap(u[2] -= t * v[2], v[2]);
        }
        return (u[1] % m + m) % m;
    }

public:
    ModInt() : v{0}{}
    ModInt(const long long val) : v{norm(val % mod + mod)} {}
    ModInt(const ModInt<mod>& n) : v{n()} {}
    explicit operator bool() const noexcept { return v != 0; }
    bool operator!() const noexcept { return !static_cast<bool>(*this); }
    ModInt& operator=(const ModInt& n){ return v = n(), (*this); }
    ModInt& operator=(const long long val){ return v = norm(val % mod + mod), (*this); }
    ModInt operator+() const { return *this; }
    ModInt operator-() const { return v == 0 ? make(0) : make(mod - v); }
    ModInt operator+(const ModInt& val) const { return make(norm(v + val())); }
    ModInt operator-(const ModInt& val) const { return make(norm(v + mod - val())); }
    ModInt operator*(const ModInt& val) const { return make((long long)v * val() % mod); }
    ModInt operator/(const ModInt& val) const { return *this * inv(val); }
    ModInt& operator+=(const ModInt& val){ return *this = *this + val; }
    ModInt& operator-=(const ModInt& val){ return *this = *this - val; }
    ModInt& operator*=(const ModInt& val){ return *this = *this * val; }
    ModInt& operator/=(const ModInt& val){ return *this = *this / val; }
    ModInt operator+(const long long val) const { return ModInt{v + val}; }
    ModInt operator-(const long long val) const { return ModInt{v - val}; }
    ModInt operator*(const long long val) const { return ModInt{(long long)v * (val % mod)}; }
    ModInt operator/(const long long val) const { return ModInt{(long long)v * inv(val)}; }
    ModInt& operator+=(const long long val){ return *this = *this + val; }
    ModInt& operator-=(const long long val){ return *this = *this - val; }
    ModInt& operator*=(const long long val){ return *this = *this * val; }
    ModInt& operator/=(const long long val){ return *this = *this / val; }
    bool operator==(const ModInt& val) const { return v == val.v; }
    bool operator!=(const ModInt& val) const { return !(*this == val); }
    bool operator==(const long long val) const { return v == norm(val % mod + mod); }
    bool operator!=(const long long val) const { return !(*this == val); }
    unsigned int operator()() const { return v; }
    friend ModInt operator+(const long long val, const ModInt& n) { return n + val; }
    friend ModInt operator-(const long long val, const ModInt& n) { return ModInt{val - n()}; }
    friend ModInt operator*(const long long val, const ModInt& n) { return n * val; }
    friend ModInt operator/(const long long val, const ModInt& n) { return ModInt{val} / n; }
    friend bool operator==(const long long val, const ModInt& n) { return n == val; }
    friend bool operator!=(const long long val, const ModInt& n) { return !(val == n); }
    friend istream& operator>>(istream& is, ModInt& n){
        unsigned int v;
        return is >> v, n = v, is;
    }
    friend ostream& operator<<(ostream& os, const ModInt& n){ return (os << n()); }
    friend ModInt mod_pow(ModInt x, long long n){
        ModInt ans = 1;
        while(n){
            if(n & 1) ans *= x;
            x *= x, n >>= 1;
        }
        return ans;
    }
};

#define MOD 998244353
using mod = ModInt<MOD>;

#define MAX_N 200000
mod inv[MAX_N],fac[MAX_N],finv[MAX_N];

void make()
{
    fac[0] = fac[1] = 1;
    finv[0] = finv[1] = 1;
    inv[1] = 1;
    for(int i=2;i<MAX_N;i++){
        inv[i] = MOD - inv[MOD % i] * (MOD / i);
        fac[i] = fac[i-1] * i;
        finv[i] = finv[i-1] * inv[i];
    }
}

mod comb(int a, int b)
{
    if(a<b) return 0;
    return fac[a] * finv[b] * finv[a-b];
}
bool ok[301][301][301];
bool used[301][301][301];
mod dp[301][301][301];
int main(){
    make();
    string s;
    cin >> s;
    int n = s.size();
    if(n==1){
        cout << 1 << endl;
        return 0;
    }
    int cc[2] = {};
    cc[s[0]-'0']++;
    cc[s[1]-'0']++;
    if(cc[0]==1&&cc[1]==1){
        ok[1][1][0] = 1;
        ok[1][0][1] = 1;
    }else if(cc[0]==2){
        ok[1][1][0] = 1;
    }else{
        ok[1][0][1] = 1;
    }
    for(int i=2;i<n;i++){
        cc[s[i]-'0']++;
    }
    for(int i=1;i<n-1;i++){
        for(int x = 0;x<=cc[0];x++){
            for(int y = 0;y<=cc[1];y++){
                if(ok[i][x][y]){
                    if(s[i+1]=='0'){
                        if(y!=0)ok[i+1][x+1][y-1] = 1;
                        ok[i+1][x][y] = 1;
                    }else{
                        if(x!=0)ok[i+1][x-1][y+1] = 1;
                        ok[i+1][x][y] = 1;
                    }
                    if(i!=n-2){
                        if(s[i+1]=='0'&&s[i+2]=='0'){
                            ok[i+2][x+1][y] = 1;
                        }
                        
                        if(s[i+1]=='0'&&s[i+2]=='1'){
                            ok[i+2][x+1][y] = 1;
                            ok[i+2][x][y+1] = 1;
                        }
                        
                        if(s[i+1]=='1'&&s[i+2]=='0'){
                            ok[i+2][x+1][y] = 1;
                            ok[i+2][x][y+1] = 1;
                        }
                        if(s[i+1]=='1'&&s[i+2]=='1'){
                            ok[i+2][x][y+1] = 1;
                        }
                    }
                }
            }   
        }
    }
    for(int x=0;x<=cc[0];x++){
        for(int y=0;y<=cc[1];y++){
            dp[n-1][x][y] = comb(x+y,y);
            // cerr << "test:" << n-1 << " " << x << " " << y << " " << dp[n-1][x][y] << endl;
        }   
    }
    for(int i=n-2;i>=0;i--){
        for(int x=0;x<=cc[0];x++){
            for(int y=0;y<=cc[1];y++){
                if(s[i+1]=='0'){
                    dp[i][x][y] += dp[i][x][y-1];
                    dp[i][x][y] += dp[i+1][x][y];
                }else{
                    dp[i][x][y] += dp[i][x-1][y];
                    dp[i][x][y] += dp[i+1][x][y];
                }
            }
        }
    }
    mod res = 1;
    for(int i=n-1;i>=0;i--){
        for(int x=0;x<=cc[0];x++){
            for(int y=0;y<=cc[1];y++){
                if(ok[i][x][y]&&!used[i][x][y]){
                    res += dp[i][x][y];
                    // cerr << i << " " << x << " " << y << " " << dp[i][x][y] << endl;
                    if(x+y!=1){
                        int xx = x;
                        int yy = y;
                        for(int g = i;g>=1;g--){
                            if(s[g]=='0'){
                                xx--;
                                if(xx>=0){
                                    used[g-1][xx][yy] = 1;
                                }
                            }else{
                                yy--;
                                if(yy>=0){
                                    used[g-1][xx][yy] = 1;
                                }
                            }
                            if(xx<0||yy<0||xx+yy==1)break;
                        }
                    }
                }
            }
        }
    }
    cout << res << endl;
    return 0;
}

Measured memory_bytes: 126548