public class Euler691 {
    static class State {
        int[] next = { -1, -1 };
        int link;
        int len;
        int occ;
    }

    static int[] buildL(int n) {
        State[] st = new State[2 * n];
        for (int i = 0; i < st.length; i++) {
            st[i] = new State();
        }

        int sz = 1;
        int last = 0;

        st[0].link = -1;
        st[0].len = 0;
        st[0].occ = 0;

        double invphi = (Math.sqrt(5.0) - 1.0) / 2.0;
        long beatPrev = 0L;

        for (int i = 0; i < n; ++i) {
            int a = Integer.bitCount(i) & 1;

            long beatCur = (long) Math.floor((i + 1) * invphi);
            int b = (int) (beatCur - beatPrev);
            beatPrev = beatCur;

            int c = a ^ b;

            int cur = sz++;
            st[cur].len = st[last].len + 1;
            st[cur].occ = 1;

            int p = last;
            while (p != -1 && st[p].next[c] == -1) {
                st[p].next[c] = cur;
                p = st[p].link;
            }

            if (p == -1) {
                st[cur].link = 0;
            } else {
                int q = st[p].next[c];
                if (st[p].len + 1 == st[q].len) {
                    st[cur].link = q;
                } else {
                    int clone = sz++;
                    st[clone].next[0] = st[q].next[0];
                    st[clone].next[1] = st[q].next[1];
                    st[clone].link = st[q].link;
                    st[clone].len = st[p].len + 1;
                    st[clone].occ = 0;

                    while (p != -1 && st[p].next[c] == q) {
                        st[p].next[c] = clone;
                        p = st[p].link;
                    }

                    st[q].link = clone;
                    st[cur].link = clone;
                }
            }

            last = cur;
        }

        int[] cntLen = new int[n + 1];
        for (int i = 0; i < sz; ++i) {
            cntLen[st[i].len]++;
        }
        for (int i = 1; i <= n; ++i) {
            cntLen[i] += cntLen[i - 1];
        }

        int[] order = new int[sz];
        for (int i = sz - 1; i >= 0; --i) {
            int l = st[i].len;
            order[--cntLen[l]] = i;
        }

        for (int i = sz - 1; i > 0; --i) {
            int v = order[i];
            int p = st[v].link;
            if (p >= 0) {
                st[p].occ += st[v].occ;
            }
        }

        int[] best = new int[n + 1];
        for (int i = 1; i < sz; ++i) {
            int occ = st[i].occ;
            if (occ <= n && st[i].len > best[occ]) {
                best[occ] = st[i].len;
            }
        }

        for (int k = n - 1; k >= 1; --k) {
            if (best[k] < best[k + 1]) {
                best[k] = best[k + 1];
            }
        }

        return best;
    }

    public static String solve() {
        int n = 5000000;
        int[] L = buildL(n);
        long out = 0L;
        for (int k = 1; k <= n; ++k) {
            int v = L[k];
            if (v == 0) {
                break;
            }
            out += v;
        }
        return Long.toString(out);
    }

    public static void main(String[] args) {
        System.out.println(solve());
    }
}