count as normal (this post is 0), but upon reaching 4, set a natural number n=0, state the value of n, and then change the counting nature to the following:
increase the previous post's n by 1, and find the maximum β of all ordinals α such that g_α(4) is less than or equal to n, where g denotes the slow growing hierarchy (https://googology.miraheze.org/wiki/Slow-growing_hierarchy). then find the new counting value by calculating H_β(4), where H denotes the Hardy hierarchy (https://googology.miraheze.org/wiki/Hardy_hierarchy), or approximating it if the exact counting value surpasses 10 billion. state the value of n used to find this value, too (and indicate it as such).
fundamental sequences used for limit ordinals are those of the Wainer hierarchy (https://googology.miraheze.org/wiki/List_of_systems_of_fundamental_sequences). you cannot contribute to the counting value two consecutive times.
example: when n=48, β=(ω^2)3 because this is the largest ordinal such that g_β(4)≤48. so, H_((ω^2)3)(4)~=10^(3.554*10^20).
