Let $n\geq 3$ be an integer. We say that a vertex $A_i (1\leq i\leq n)$ of a convex polygon $A_1A_2 \dots A_n$ is [i]Bohemian[/i] if its reflection with respect to the midpoint of $A_{i-1}A_{i+1}$ (with $A_0=A_n$ and $A_1=A_{n+1}$) lies inside or on the boundary of the polygon $A_1A_2\dots A_n$. Determine the smallest possible number of Bohemian  vertices a convex $n$-gon can have (depending on $n$).

[i]Proposed by Dominik Burek, Poland [/i]
1. **Define the Problem and Notations:**
   Let \( n \geq 3 \) be an integer. We say that a vertex \( A_i \) (\( 1 \leq i \leq n \)) of a convex polygon \( A_1A_2 \dots A_n \) is *Bohemian* if its reflection with respect to the midpoint of \( A_{i-1}A_{i+1} \) (with \( A_0 = A_n \) and \( A_1 = A_{n+1} \)) lies inside or on the boundary of the polygon \( A_1A_2 \dots A_n \). We need to determine the smallest possible number of Bohemian vertices a convex \( n \)-gon can have, denoted as \( M(n) \).

2. **Base Case for \( n = 3 \):**
   - For a triangle (\( n = 3 \)), consider the vertices \( A_1, A_2, A_3 \).
   - The reflection of each vertex with respect to the midpoint of the opposite side will lie outside the triangle.
   - Therefore, \( M(3) = 0 \).

3. **Base Case for \( n = 4 \):**
   - For a quadrilateral (\( n = 4 \)), consider the vertices \( A_1, A_2, A_3, A_4 \).
   - We need to show that there is at least one Bohemian vertex.
   - If the quadrilateral is not a parallelogram, it will have at least two obtuse angles.
   - If the obtuse angles are at neighboring vertices, say \( A_1 \) and \( A_2 \), then the reflection of \( A_1 \) with respect to the midpoint of \( A_4A_2 \) will lie inside the quadrilateral.
   - If the obtuse angles are at non-neighboring vertices, say \( A_1 \) and \( A_3 \), then the reflection of \( A_1 \) with respect to the midpoint of \( A_4A_2 \) or the reflection of \( A_3 \) with respect to the midpoint of \( A_2A_4 \) will lie inside the quadrilateral.
   - Therefore, \( M(4) = 1 \).

4. **Inductive Step for \( n \geq 5 \):**
   - Assume that for any convex \( (n-1) \)-gon, the minimal number of Bohemian vertices is \( (n-1) - 3 = n - 4 \).
   - Consider a convex \( n \)-gon \( A_1A_2 \dots A_n \).
   - By the induction hypothesis, the convex \( (n-1) \)-gon \( A_1A_2 \dots A_{n-1} \) has at least \( n-4 \) Bohemian vertices.
   - Removing one vertex from the \( n \)-gon and considering the remaining \( (n-1) \)-gon, we can ensure that at least \( n-4 \) vertices are Bohemian.
   - Adding back the removed vertex, we need to check if it can be Bohemian. If not, the number of Bohemian vertices remains \( n-4 \).
   - Therefore, the minimal number of Bohemian vertices in an \( n \)-gon is \( n-3 \).

5. **Conclusion:**
   - By induction, the minimal number of Bohemian vertices in a convex \( n \)-gon is \( n-3 \) for all \( n \geq 3 \).

\(\blacksquare\)

The final answer is \( \boxed{ n-3 } \)