#include <bits/stdc++.h>
const int maxn = 1011;
const int mod = 256;
char str[maxn];
int main() {
  gets(str);
  int len = strlen(str);
  int sad = 0;
  for (int i = 0; i < len; i++) {
    int a[11] = {0}, j = 0, temp = 0;
    int c = str[i];
    while (c) {
      a[j++] = c % 2;
      c /= 2;
    }
    for (int j = 7, k = 1; j >= 0; j--, k *= 2) {
      temp += a[j] * k;
    }
    int res = (sad - temp + mod) % mod;
    printf("%d\n", res);
    sad = temp;
  }
  return 0;
}
