  In this paper, we introduce a prime factorization of open meanders,
articulated through the framework of 2-colored operads. We demonstrate that
each open meander can be canonically constructed from building blocks of two
types: iterated snakes and irreducible meanders. We find out that iterated
snakes allow efficient enumeration, and thus the problem of enumerating
meanders reduces to the problem of enumerating irreducible meanders.
Additionally, we present some results concerning the asymptotic of meanders of
both classes.
