Petya and Vasya are given equal sets of $ N$ weights, in which the masses of any two weights are in ratio at most $ 1.25$. Petya succeeded to divide his set into $ 10$ groups of equal masses, while Vasya succeeded to divide his set into $ 11$ groups of equal masses. Find the smallest possible $ N$.
1. Let \( W = \{a_1 \leq a_2 \leq \dots \leq a_N\} \) be the set of masses of the weights. Without loss of generality, assume \( a_1 = 4 \). Given that the ratio of any two weights is at most 1.25, it follows that \( a_N \leq 5 \).

2. Suppose \( 41 \leq N \leq 49 \). Petya divides his set into 10 groups of equal masses, denoted as \( A_1, A_2, \dots, A_{10} \). Let \( S(A_i) \) represent the sum of the masses of weights in \( A_i \).

3. If there exists a group \( A_i \) such that \( |A_i| \leq 3 \), then \( S(A_i) \leq 15 \). However, there must exist another group \( A_j \) such that \( |A_j| \geq 5 \), implying \( S(A_j) \geq 20 \). This is a contradiction because all groups must have equal masses.

4. Now, suppose there exists a group \( A_i \) such that \( |A_i| \geq 6 \). Then \( S(A_i) \geq 24 \). It follows that \( |A_j| \geq 5 \) for all \( 1 \leq j \leq 10 \), implying \( N \geq 51 \). This is also a contradiction.

5. Hence, there are only two types of groups \( A_i \): those with 5 weights and those with 4 weights. If \( |A_i| = 4 \), then \( A_i = \{5, 5, 5, 5\} \). If \( |A_j| = 5 \), then \( A_j = \{4, 4, 4, 4, 4\} \). Therefore, the weights are either 4 or 5.

6. Suppose there are \( 4k \) weights of 5 and \( 5l \) weights of 4. We conclude that \( 20 \mid N \), which is a contradiction.

7. If \( |A_i| = 3 \), then \( |A_j| = 3 \) for all \( 1 \leq j \leq 10 \), implying \( N = 30 \). Similarly, we conclude that \( N \) can only be 20, 30, or 40, and they consist of groups with the number of elements equal to \( \frac{N}{10} \).

8. Let \( N = 40 \). Now, let \( B_1, B_2, \dots, B_{11} \) be eleven groups with equal sums of masses. Then there exist \( B_i \) and \( B_j \) such that \( |B_i| \leq 3 \) and \( |B_j| \geq 4 \). But then \( S(B_i) \leq 15 \) and \( S(B_j) \geq 16 \), which is a contradiction.

9. Similarly, we can obtain contradictions for cases \( N = 20 \) and \( N = 30 \).

10. The last step is to show an example for \( N = 50 \):
    - Let \( W = \{4, 4, \dots, 4, 5, \dots, 5\} \), consisting only of 4 and 5, where 4 repeats 30 times and 5 repeats 20 times.
    - Let \( A_i = \{4, 4, 4, 5, 5\} \) for all \( 1 \leq i \leq 10 \).
    - Let \( B_j = \{4, 4, 4, 4, 4\} \) for \( 1 \leq j \leq 6 \), and \( B_j = \{5, 5, 5, 5\} \) for \( 7 \leq j \leq 11 \).

Thus, the smallest possible \( N \) is 50.

The final answer is \( \boxed{ 50 } \).