```python
import math

def count_Intgral_Points(x1, y1, x2, y2):
    """
    Counts the number of integral co-ordinates that lie strictly inside an axis-aligned square
    defined by two opposite integer vertices (x1, y1) and (x2, y2).
    
    Args:
        x1 (int): The x-coordinate of the first vertex.
        y1 (int): The y-coordinate of the first vertex.
        x2 (int): The x-coordinate of the second vertex.
        y2 (int): The y-coordinate of the second vertex.
        
    Returns:
        int: The number of integral points inside the square.
    """
    # Assuming the square is axis-aligned, the side length can be determined
    # from the absolute difference of the x-coordinates (or y-coordinates).
    side_length = abs(x1 - x2)
    
    # The number of integers strictly between two integers 'a' and 'b' is abs(a - b) - 1.
    # This represents the number of interior integral points along one dimension of the square.
    num_points_1d = side_length - 1
    
    # The total number of interior points is the square of the number of points along one dimension.
    # If num_points_1d is not positive (i.e., side_length is 0 or 1), the result is 0.
    return max(0, num_points_1d) ** 2
```