#include <bits/stdc++.h>
using namespace std;
bool is_palindrome(const string &s, int start, int end) {
  int sz = end - start + 1;
  if (sz % 2 == 0) {
    int middle = start + sz / 2;
    int i;
    for (i = 0; middle - 1 - i >= 0 && middle + i <= end &&
                s[middle - 1 - i] == s[middle + i];
         i++)
      ;
    if (middle - i - 1 < 0 || middle + i > end) return true;
  } else {
    int middle = start + sz / 2;
    int i;
    for (i = 1;
         middle - i >= 0 && middle + i <= end && s[middle - i] == s[middle + i];
         i++)
      ;
    if (middle - i < 0 || middle + i > end) return true;
  }
  return false;
}
int euclidd, euclidx, euclidy;
void extendedeuclid(int a, int b) {
  if (b == 0) {
    euclidd = a;
    euclidx = 1;
    euclidy = 0;
    return;
  }
  extendedeuclid(b, a % b);
  int d1, x1, y1;
  d1 = euclidd;
  x1 = euclidx;
  y1 = euclidy;
  euclidx = y1;
  euclidy = x1 - ((a / b) * y1);
}
double area_triangle(double x1, double y1, double x2, double y2, double x3,
                     double y3) {
  double a;
  a = x1 * (y2 - y3) + y1 * (x3 - x2) + ((x2 * y3) - (y2 * x3)) + 1e-9;
  a = a / 2 + 1e-9;
  return a;
}
double dist_2point(double x1, double y1, double x2, double y2) {
  double d;
  d = sqrt(pow((x1 - x2), 2) + pow((y1 - y2), 2));
  return d;
}
int binary_search(int a[], int n, int l, int u) {
  int mid;
  if (l > u) return 0;
  mid = floor(l + u) / 2;
  if (a[mid] == n)
    return mid;
  else if (a[mid] > n)
    binary_search(a, n, l, mid - 1);
  else
    binary_search(a, n, mid + 1, u);
}
long gcd(long a, long b) {
  while (b > 0) {
    a = a % b;
    a = a ^ b;
    b = b ^ a;
    a = a ^ b;
  }
  return a;
}
long lcm(long a, long b) {
  long x = (a * b) / gcd(a, b);
  return x;
}
long is_prime(long n) {
  long ii;
  if (n == 1) return 0;
  if (n == 2) return 1;
  if (n % 2 == 0) return 0;
  for (ii = 3; ii * ii <= n; ii = ii + 2)
    if (n % ii == 0) return 0;
  return 1;
}
long REV(long np) {
  long rev = 0;
  while (np != 0) {
    rev = rev * 10 + np % 10;
    np = np / 10;
  }
  return rev;
}
int main() {
  int n, ii;
  cin >> n;
  for (ii = 0; ii < n; ii++) {
    char a[110] = {0}, b[10][10] = {0};
    cin >> a;
    int mm = 0, kk, l, cc, k, tt, t1, j;
    l = strlen(a);
    for (k = 0; k < l; k++) {
      if (a[k] != ':') {
        kk = 0;
        while (a[k] != ':' && k < l) {
          b[mm][kk] = a[k];
          kk++;
          k++;
        }
        mm++;
      }
    }
    t1 = 0;
    int te2;
    j = 0;
    for (k = 0; k < 8; k++) {
      if (a[j] == ':') {
        if (a[0] == ':' && strlen(a) == 2)
          te2 = 7;
        else
          te2 = 8 - mm;
        for (tt = 0; tt < te2; tt++) {
          cout << "0000";
          if (k < 7) cout << ":";
          k++;
        }
        if (a[0] == ':' && a[1] == ':')
          j = j + 2;
        else
          j = j + 1;
      }
      if (a[j] == b[t1][0] && k < 8) {
        for (tt = 0; tt < 4 - strlen(b[t1]); tt++) cout << "0";
        cout << b[t1];
        j = j + strlen(b[t1]) + 1;
        t1++;
      }
      if (k < 7) cout << ":";
    }
    cout << endl;
  }
  return 0;
}
