目标:你的客户排队,每第二个客户订购茶 (2位,4位,6位,8位,......).你列出他们,并为每位素数茶客户分发T恤.考虑到你今天的客户总数,你分发了多少T恤?示例:你有4个客户:客户1订购东西客户2订购茶 (1名茶客户) 客户3订购东西客户4订购茶,得到T恤 (2名茶客户 -->素数2) 答案是1输入:行1:为你拥有的客户数的整数n.
The solution to the problem can be found using the following steps:

1. Initialize a variable to count the number of T-Shirts handed out to 0.
2. Create a loop to iterate through each customer number from 1 to n.
3. For every even customer number, increment a counter.
4. Check if the counter value is a prime number using a separate function.
5. If the counter value is prime, increment the T-Shirt counter by 1.
6. Return the T-Shirt counter as the output.

Here's the Python code to implement this:

```
def is_prime(n):
    if n < 2:
        return False
    for i in range(2, int(n**(0.5))+1):
        if n % i == 0:
            return False
    return True

n = int(input())
t_shirts = 0
counter = 0

for i in range(1, n+1):
    if i % 2 == 0:
        counter += 1
        if is_prime(counter):
            t_shirts += 1

print(t_shirts)
```

You can input the value of n on the first line and the code will output the number of T-Shirts handed out.