#include<bits/stdc++.h>
#define ll long long
using namespace std;
const ll INF=0x3f3f3f3f;
const ll N=1e6+10,M=2e6+10;
ll a[N],x[N],y[N];
vector<char>ans;
void solve(){
string s1,s2;
cin>>s1>>s2;
ll len=s1.size();
for(ll i=0;i<len;i++){
if(a[s1[i]]!=0 && a[s1[i]]!=s2[i]){
cout<<-1<<endl;
return;
}
if(a[s2[i]]!=0 && a[s2[i]]!=s1[i]){
cout<<-1<<endl;
return;
}
if(a[s1[i]]==s2[i])continue;
if(a[s2[i]]==s1[i])continue;
a[s1[i]]=s2[i];
a[s2[i]]=s1[i];
if(s1[i]==s2[i])continue;
ans.push_back(s1[i]);
ans.push_back(s2[i]);
}
cout<<ans.size()/2<<endl;
for(ll i=0;i<ans.size();i+=2){
cout<<ans[i]<<" "<<ans[i+1]<<endl;
}
}
signed main(){
int _=1;
// cin>>_;
while(_--)solve();
return 0;
}
/*
he
ei
*/
137. Single Number II | 130. Surrounded Regions |
129. Sum Root to Leaf Numbers | 120. Triangle |
102. Binary Tree Level Order Traversal | 96. Unique Binary Search Trees |
75. Sort Colors | 74. Search a 2D Matrix |
71. Simplify Path | 62. Unique Paths |
50. Pow(x, n) | 43. Multiply Strings |
34. Find First and Last Position of Element in Sorted Array | 33. Search in Rotated Sorted Array |
17. Letter Combinations of a Phone Number | 5. Longest Palindromic Substring |
3. Longest Substring Without Repeating Characters | 1312. Minimum Insertion Steps to Make a String Palindrome |
1092. Shortest Common Supersequence | 1044. Longest Duplicate Substring |
1032. Stream of Characters | 987. Vertical Order Traversal of a Binary Tree |
952. Largest Component Size by Common Factor | 212. Word Search II |
174. Dungeon Game | 127. Word Ladder |
123. Best Time to Buy and Sell Stock III | 85. Maximal Rectangle |
84. Largest Rectangle in Histogram | 60. Permutation Sequence |