------
## 最终结论
```python
def skjkasdkd(lst):
    max_prime = -1  # Initialize variable to store the largest prime number
    digit_sum = 0    # Initialize variable to store the sum of digits of the largest prime

    for num in lst:
        if num > 1:  # Only consider numbers greater than 1
            is_prime = True
            for i in range(2, int(num**0.5) + 1):
                if num % i == 0:
                    is_prime = False
                    break
            if is_prime and num > max_prime:
                max_prime = num  # Update max_prime if a larger prime is found

    if max_prime != -1:  # Check if a prime was found
        digit_sum = sum(int(digit) for digit in str(max_prime))  # Calculate the sum of digits of the largest prime
    return digit_sum  # Return the sum of digits
```