#include <bits/stdc++.h>
using namespace std;
void merge(long long int arr[], long long int l, long long int m,
           long long int r) {
  long long int n1 = m - l + 1;
  long long int n2 = r - m;
  long long int L[n1], R[n2];
  for (long long int i = 0; i < n1; i++) L[i] = arr[l + i];
  for (long long int j = 0; j < n2; j++) R[j] = arr[m + 1 + j];
  long long int i = 0;
  long long int j = 0;
  long long int k = l;
  while (i < n1 && j < n2) {
    if (L[i] <= R[j]) {
      arr[k] = L[i];
      i++;
    } else {
      arr[k] = R[j];
      j++;
    }
    k++;
  }
  while (i < n1) {
    arr[k] = L[i];
    i++;
    k++;
  }
  while (j < n2) {
    arr[k] = R[j];
    j++;
    k++;
  }
}
void mergeSort(long long int arr[], long long int l, long long int r) {
  if (l >= r) {
    return;
  }
  long long int m = (l + r - 1) / 2;
  mergeSort(arr, l, m);
  mergeSort(arr, m + 1, r);
  merge(arr, l, m, r);
}
int main() {
  long long int t;
  cin >> t;
  while (t--) {
    long long int n, x, total = 0;
    cin >> n;
    x = n;
    while (1) {
      total += x - (x % 10);
      x = (x / 10) + (x % 10);
      if (x < 10) {
        total += x;
        break;
      }
    }
    cout << total << endl;
  }
  return 0;
}
