#include <string>
#include <vector>
#include <list>
#include <cmath>
#include <algorithm>
#include <map>
#include <set>
#include <iostream>
#include <sstream>
#include <cstdio>
#include <cstdlib>
using namespace std;

class Solution {
public:
    bool isAlienSorted(vector<string>& words, string order);
};

bool Solution::isAlienSorted(vector<string>& words, string order)
{
  string trans;
  int i, j;

  trans.resize(26, ' ');
  for (i = 0; i < order.size(); i++) trans[order[i]-'a'] = 'a' + i;
  for (i = 0; i < words.size(); i++) {
    for (j = 0; j < words[i].size(); j++) {
      words[i][j] = trans[words[i][j]-'a'];
    }
    if (i > 0 && words[i] < words[i-1]) return false;
  }
  return true;
  
}

int main()
{
  vector <string> d;
  string order;
  int i;
  Solution s;
  bool b;

  while (cin >> order) d.push_back(order);
  d.pop_back();

  b = s.isAlienSorted(d, order);
  printf("%d\n", b);
  return 0;
}