# Sum of Digits

### Problem Statement :

```You're given an integer N. Write a program to calculate the sum of all the digits of N.

Input

The first line contains an integer T, the total number of testcases. Then follow T lines, each line contains an integer N.

Output

For each test case, calculate the sum of digits of N, and display it in a new line.

Constraints
1 ≤ T ≤ 1000
1 ≤ N ≤ 1000000

Example

Input

3
12345
31203
2123

Output

15
9
8```

### Solution :

```                            ```Solution in C :

#include <stdio.h>

int main(void) {
int t;
scanf("%d",&t);
while (t--){
int n,m,sum=0;
scanf ("%d",&n);
while(n>0){

m=n%10;
n=n/10;

sum=sum+m;
}
printf("%d\n",sum);

}

return 0;
}```
```

```                        ```Solution in C++ :

#include <iostream>
using namespace std;

int main()
{
int t;
cin>>t;

while(t--)
{
int n;
cin>>n;

int sum=0;

while(n>0)
{
sum+=(n%10);
n/=10;
}

cout<<sum<<"\n";

}
return 0;
}```
```

```                        ```Solution in Java :

import java.util.*;
class Main{
public static void main(String[] args){
try
{
Scanner sc = new Scanner(System.in);
int n = sc.nextInt();
for(int i=0;i<n;i++){
int a = sc.nextInt();
int sum = 0 ;
while(a>0){
int temp = a%10;
sum +=temp;
a/=10;
}
System.out.println(sum);
}
}
catch(Exception e)
{
return;
}
}
}```
```

```                        ```Solution in Python :

T=int(input())
for i in range(T):
num=int(input())
sum=0
for j in str(num):
sum+=int(j)
print(sum)```
```

## Delete a Node

Delete the node at a given position in a linked list and return a reference to the head node. The head is at position 0. The list may be empty after you delete the node. In that case, return a null value. Example: list=0->1->2->3 position=2 After removing the node at position 2, list'= 0->1->-3. Function Description: Complete the deleteNode function in the editor below. deleteNo

## Print in Reverse

Given a pointer to the head of a singly-linked list, print each data value from the reversed list. If the given list is empty, do not print anything. Example head* refers to the linked list with data values 1->2->3->Null Print the following: 3 2 1 Function Description: Complete the reversePrint function in the editor below. reversePrint has the following parameters: Sing

Given the pointer to the head node of a linked list, change the next pointers of the nodes so that their order is reversed. The head pointer given may be null meaning that the initial list is empty. Example: head references the list 1->2->3->Null. Manipulate the next pointers of each node in place and return head, now referencing the head of the list 3->2->1->Null. Function Descriptio