Aureole the Techno-cultural fest of JEC thought of conducting a workshop on big data, as the topic is hot everyone wants to take part but due to limited seats in the Jashan Auditorium there is a selection criteria, a problem is given.
the problem states a string is to be compressed when two or more consecutive characters are same they are to be compressed into one character and the original number count is to be written after it ex. aaabb -> a3b2
where every character is of 8bits and every integer is of 32bits
you are asked to find the difference in size between original string and compressed string

-----Input:-----
- First line will contain $T$, number of testcases. Then the testcases follow. 
- Each testcase contains of a single line of input $S$ the string to be compressed. 

-----Output:-----
For each testcase, output in a single line The difference in size.

-----Constraints-----
- $1 \leq T \leq 100$
- $1 \leq |S| \leq 10^5$

-----Subtasks-----
- 40 points : S will contain only a-z
- 60 points : S will contain 0-9 characters also

-----Sample Input:-----
1
aaabb

-----Sample Output:-----
-40

-----EXPLANATION:-----
the resulting string will be a3b2 its size will be 80, original string size will be 40 so ans= 40-80

```python

USER_FILENAME = "<user_code>"
import sys, json, builtins
import math, heapq, bisect, itertools, functools, collections, statistics, fractions, decimal, operator, array, random, re, string, os, pathlib
try:
    import resource as _res
except Exception:
    _res = None
from collections import Counter, defaultdict, deque, OrderedDict
from functools import lru_cache, reduce
from itertools import accumulate, permutations, combinations, product
from math import gcd, ceil, floor, sqrt
from decimal import Decimal
try:
    from typing import *
except Exception:
    pass
try:
    sys.setrecursionlimit(1_000_000)
except Exception:
    pass
try:
    import site as _site
    try:
        _sys_sites = _site.getsitepackages() if hasattr(_site, "getsitepackages") else []
        for _p in _sys_sites:
            if _p and _p not in sys.path:
                sys.path.append(_p)
    except Exception:
        pass
    try:
        _usp = _site.getusersitepackages()
        if isinstance(_usp, str):
            _usp = [_usp]
        for _p in _usp:
            if _p and _p not in sys.path:
                sys.path.append(_p)
    except Exception:
        pass
except Exception:
    pass

ns = {"__name__": "__main__"}
for _k, _v in list(globals().items()):
    if not _k.startswith("_"):
        ns[_k] = _v
_CODE = '# cook your dish here\r\nfrom sys import stdin, stdout\r\nimport math\r\nfrom itertools import permutations, combinations\r\nfrom collections import defaultdict\r\nfrom bisect import bisect_left \r\nfrom bisect import bisect_right\r\n \r\ndef L():\r\n    return list(map(int, stdin.readline().split()))\r\n \r\ndef In():\r\n    return list(map(int, stdin.readline().split()))\r\n \r\ndef I():\r\n    return int(stdin.readline())\r\n \r\nP = 1000000007\r\ndef main():\r\n    for t in range(I()):\r\n        s = input()\r\n        st = s[0]\r\n        i = 1\r\n        c1, c2 = 1, 0\r\n        while i < len(s):\r\n            if s[i] == s[i-1]:\r\n                j = i \r\n                c = 0\r\n                while j < len(s) and s[j] == s[i-1]:\r\n                    c += 1 \r\n                    j += 1 \r\n                if c != 0:\r\n                    c2 += 1\r\n                    i = j-1 \r\n                    st += str(c+1)\r\n            else:\r\n                st += s[i]\r\n                c1 += 1\r\n            i += 1 \r\n        print(len(s)*8 -(c1*8+c2*32))\r\n    \r\ndef __starting_point():\r\n    main()\r\n\n__starting_point()'
_co = compile(_CODE, USER_FILENAME, "exec")
exec(_co, ns, ns)

```

Measured memory_bytes: 15501